The partition problem

Sunil Chopra*, M. R. Rao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

128 Scopus citations

Abstract

In this paper we describe several forms of the k-partition problem and give integer programming formulations of each case. The dimension of the associated polytopes and some basic facets are identified. We also give several valid and facet defining inequalities for each of the polytopes.

Original languageEnglish (US)
Pages (from-to)87-115
Number of pages29
JournalMathematical Programming
Volume59
Issue number1-3
DOIs
StatePublished - Mar 1 1993

Keywords

  • Graph partition
  • facet
  • multiway cut
  • polytope

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'The partition problem'. Together they form a unique fingerprint.

Cite this