A Note on Clique-Web Facets for Multicut Polytopes

Michael M. Sørensen
Michael M. Sørensen
[email protected]
The Aarhus School of Business, Department of Management Science and Logistics, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Search for more papers by this author

Michael M. Sørensen

Michael M. Sørensen

[email protected]

The Aarhus School of Business, Department of Management Science and Logistics, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark

Search for more papers by this author

Published Online:1 Nov 2002https://doi.org/10.1287/moor.27.4.740.301

References

Chopra S., Rao M. R. The partition problem. Math. Programming (1993) 59:87–115Crossref, Google Scholar
Deza M., Grötschel M., Laurent M. Clique-web facets for multicut polytopes. Math. Oper. Res. (1992) 17:981–1000Link, Google Scholar
Deza M., Laurent M. Facets for the cut cone I. Math. Programming (1992a) 56:121–160Crossref, Google Scholar
Deza M., Laurent M. Facets for the cut cone. II: Clique-web facets. Math. Programming (1992b) 56:161–188Crossref, Google Scholar
Grötschel M., Wakabayashi Y. Facets of the clique partitioning polytope. Math. Programming (1990) 47:367–387Crossref, Google Scholar

cover image Mathematics of Operations Research

Volume 27, Issue 4

November 2002

Pages 637-842

Article Information

Metrics

Information

Received:March 25, 2002
Published Online:November 01, 2002

© 2002 INFORMS

Cite as

Michael M. Sørensen, (2002) A Note on Clique-Web Facets for Multicut Polytopes. Mathematics of Operations Research 27(4):740-742.

https://doi.org/10.1287/moor.27.4.740.301

Keywords