Parametric cardinality probing in set partitioning

Anito Joseph, Edward K. Baker

Research output: Contribution to journalArticlepeer-review


In this work, we investigate parametric probing methods based on solution cardinality for set partitioning problems. The methods used are inspired by the early work of Gass and Saaty on the parametric solution to linear programs, as well as the later work of Joseph, Gass, and Bryson that examined the duality gap between the integer and relaxation solutions to general integer programming problems. Computational results are presented for a collection of set partitioning problems found in the literature.

Original languageEnglish (US)
Pages (from-to)211-221
Number of pages11
JournalOperations Research/ Computer Science Interfaces Series
StatePublished - Jan 1 2006


  • Parametric cardinality probing
  • Set partitioning

ASJC Scopus subject areas

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


Dive into the research topics of 'Parametric cardinality probing in set partitioning'. Together they form a unique fingerprint.

Cite this