A Note on Clique-Web Facets for Multicut Polytopes
From MaRDI portal
Publication:5704106
DOI10.1287/moor.27.4.740.301zbMath1082.90104OpenAlexW2042503211MaRDI QIDQ5704106
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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Related Items
A polyhedral study of lifted multicuts, Binary positive semidefinite matrices and associated integer polytopes, Facet-defining inequalities for the simple graph partitioning polytope, Projection results for the \(k\)-partition problem, Max-multiflow/min-multicut for G+H series-parallel