Clique-Web Facets for Multicut Polytopes
From MaRDI portal
Publication:4027782
DOI10.1287/moor.17.4.981zbMath0762.90079MaRDI QIDQ4027782
Martin Grötschel, Monique Laurent, Michel Marie Deza
Publication date: 1 March 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.17.4.981
90C35: Programming involving graphs or networks
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
Related Items
The clique partitioning problem: Facets and patching facets, Size-constrained graph partitioning polytopes, The even and odd cut polytopes, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Compositions in the bipartite subgraph polytope, Facets for the cut cone. II: Clique-web inequalities, Collapsing and lifting for the cut cone, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, Application of cut polyhedra. I, Facets of the \(k\)-partition polytope, On the partial order polytope of a digraph, The partition problem, Facet-defining inequalities for the simple graph partitioning polytope, Binary Positive Semidefinite Matrices and Associated Integer Polytopes