A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems

M.G.C. van Krieken, H.A. Fleuren, M.J.P. Peeters

Research output: Working paperDiscussion paperOther research output

253 Downloads (Pure)

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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages21
Volume2004-44
Publication statusPublished - 2004

Publication series

NameCentER Discussion Paper
Volume2004-44

Keywords

  • algorithm
  • integer programming

Fingerprint Dive into the research topics of 'A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems'. Together they form a unique fingerprint.

  • Cite this

    van Krieken, M. G. C., Fleuren, H. A., & Peeters, M. J. P. (2004). A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems. (CentER Discussion Paper; Vol. 2004-44). Operations research.