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.
|Place of Publication||Tilburg|
|Number of pages||21|
|Publication status||Published - 2004|
|Name||CentER Discussion Paper|
- integer programming