Cyclic group and knapsack facets

Julián Aráoz, Lisa A Miller, Ralph E. Gomory, Ellis L. Johnson

Research output: Contribution to journalArticlepeer-review

44 Scopus citations


Any integer program may be relaxed to a group problem. We define the master cyclic group problem and several master knapsack problems, show the relationship between the problems, and give several classes of facet-defining inequalities for each problem, as well as a set of mappings that take facets from one type of master polyhedra to another.

Original languageEnglish (US)
Pages (from-to)377-408
Number of pages32
JournalMathematical Programming, Series B
Issue number2
StatePublished - May 1 2003


Dive into the research topics of 'Cyclic group and knapsack facets'. Together they form a unique fingerprint.

Cite this