In [1] we have introduced the clique partitioning problem and studied the associated polyhedron, the so-called clique partitioning polytope. In this paper we continue these polyhedral investigations; in particular, we present new classes of facets and methods to construct new facet-defining inequalities from given facet-defining inequalities.
CITATION STYLE
Grötschel, M., & Wakabayashi, Y. (1990). Composition of Facets of the Clique Partitioning Polytope. In Topics in Combinatorics and Graph Theory (pp. 271–284). Physica-Verlag HD. https://doi.org/10.1007/978-3-642-46908-4_31
Mendeley helps you to discover research relevant for your work.