A Note on Clique-Web Facets for Multicut Polytopes

DOI10.1287/MOOR.27.4.740.301MaRDI QIDQ5704106zbMATH OpenOpenAlexFDO

Authors Michael Malmros Sørensen

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.27.4.740.301

zbMATH Keywords

facets, multicuts, polyhedra

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Clique-Web Facets for Multicut Polytopes
• On the cut polytope
• Facets for the cut cone. II: Clique-web inequalities
• Facets of the clique partitioning polytope
• scientific article; zbMATH DE number 17641

Cited in

(6)

• Projection results for the \(k\)-partition problem
• Max-multiflow/min-multicut for G+H series-parallel
• Facet-defining inequalities for the simple graph partitioning polytope
• A polyhedral study of lifted multicuts
• Clique-Web Facets for Multicut Polytopes
• Binary positive semidefinite matrices and associated integer polytopes

This page was built for publication: A Note on Clique-Web Facets for Multicut Polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704106)