Generating Set Partitioning Test Problems with Known Optimal Integer Solutions

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 u...

Full description

Saved in:
Bibliographic Details
Published inThe Next Wave in Computing, Optimization, and Decision Technologies pp. 29 - 44
Main Authors Baker, Edward K., Joseph, Anito, Rayco, Brenda
Format Book Chapter
LanguageEnglish
Published Boston, MA Springer US 2005
SeriesOperations Research/Computer Science Interfaces Series
Subjects
branch and bound
cardinality probing
integer programming
test problems
Online AccessGet full text

Cover

More Information
Summary: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
ISBN:0387235280
9780387235288
ISSN:1387-666X
DOI:10.1007/0-387-23529-9_3