A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems

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.

MoreLess

Year of publication:	2004
Authors:	Fleuren, Hein ; van Krieken, M.G.C. ; Peeters, M.J.P.
Institutions:	Tilburg University, Center for Economic Research
Subject:	algorithm \| integer programming

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Discussion Paper.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series CentER Discussion Paper Number 2004-44
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011096216