Start of Main Content
Author(s)

Sunil Chopra

M. Rao

In this paper we describe several forms of thek-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.
Date Published: 1993
Citations: Chopra, Sunil, M. Rao. 1993. The Partition Problem. Mathematical Programming. (1)87-115.