@techreport{411424a6e9ef4e138684a6cf98bd6b46,
title = "A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems",
abstract = "In this paper we discuss a solver that is developed to solve set partitioning problems.The methods used include problem reduction techniques, lagrangean relaxation and primal and dual heuristics.The optimal solution is found using a branch and bound approach.In this paper we discuss these techniques.Furthermore, we present the results of several computational experiments and compare the performance of our solver with the well-known mathematical optimization solver Cplex.",
keywords = "integer programming, set partitioning, Branch and bound, lagrangean relaxation",
author = "{van Krieken}, M.G.C. and H.A. Fleuren and M.J.P. Peeters",
note = "Pagination: 21",
year = "2004",
language = "English",
volume = "2004-44",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",
}