A Note on Clique-Web Facets for Multicut Polytopes

Authors:
Michael M. Sørensen
Affiliations:
-
Venue:
Mathematics of Operations Research
Year:
2002

Citing 5
Cited 1

Facets of the clique partitioning polytope

Mathematical Programming: Series A and B
Clique-web facets for multicut polytopes

Mathematics of Operations Research
The partition problem

Mathematical Programming: Series A and B
Facets for the cut cone I

Mathematical Programming: Series A and B
Facets for the cut cone II: clique-web inequalities

Mathematical Programming: Series A and B

Facet-defining inequalities for the simple graph partitioning polytope

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note we provide a previously undiscovered necessary condition for the facet-defining property of clique-web inequalities for the multicut polytope. This condition imposes a minimum cardinality requirement on the node set of the clique, thus implying, in general, that clique-web inequalities associated with relatively small cliques are not facet-defining for multicut polytopes.