Abstract
In this paper we prove two lifting theorems for the clique partitioning polytope, which provide sufficient conditions for a valid inequality to be facet-defining. In particular, if a valid inequality defines a facet of the polytope corresponding to the complete graph K-m on m vertices, it defines a facet for the polytope corresponding to K-n for all n>m. This answers a question raised by Grotschel and Wakabayashi. Further, for the case of arbitrary graphs, we characterize when the so-called 2-partition inequalities define facets. (C) 1999 Elsevier Science B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 235-243 |
Number of pages | 9 |
Journal | Operations Research Letters |
Volume | 24 |
Issue number | 5 |
DOIs | |
Publication status | Published - Jun 1999 |
Keywords
- polyhedral combinatorics
- facets
- lifting
- clique partitioning
- POLYTOPE