Generating set partitioning test problems with known optimal integer solutions

Edward K. Baker, Anito Joseph, Brenda Rayco

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)29-44
Number of pages16
JournalOperations Research/ Computer Science Interfaces Series
Volume29
StatePublished - Dec 1 2005

    Fingerprint

Keywords

  • Branch and bound
  • Cardinality probing
  • Integer programming
  • Test problems

ASJC Scopus subject areas

  • Computer Science(all)
  • Management Science and Operations Research

Cite this