Sign in
Back
Generating Set Partitioning Test Problems with Known Optimal Integer Solutions
Book chapter

Generating Set Partitioning Test Problems with Known Optimal Integer Solutions

Edward K Baker, Anito Joseph and Brenda Rayco
The Next Wave in Computing, Optimization, and Decision Technologies, pp.29-44
Operations Research/Computer Science Interfaces Series, Springer US
DOI: https://doi.org/10.1007/0-387-23529-9_3

Abstract

test problems cardinality probing integer programming branch and bound
In this work, we investigate methods for generating set partitioning test problems with known integer solutions. The problems are generated with various cost structures so that their solution by well-known integer programming methods can be shown to be difficult. Computational results are obtained using the branch and bound methods of the CPLEX solver. Possible extensions are considered to the area of cardinality probing of the solutions

Metrics

6 Record Views

Details