scientific article; zbMATH DE number 17641

zbMATH Open0737.52007MaRDI QIDQ3974969FDOQ3974969

Authors: Martin Grötschel, Michel Deza, Monique Laurent Edit this on Wikidata

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Clique-Web Facets for Multicut Polytopes
• On the polyhedral structure of uniform cut polytopes
• On the cut polytope
• Small min-cut polyhedra
• scientific article; zbMATH DE number 1079001

zbMATH Keywords

inequalitiespolyhedracomplete graphsmulticutenumeration of facets

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Enumeration in graph theory (05C30)

Cited In (12)

• The even and odd cut polytopes
• The inequicut cone
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
• Clique-Web Facets for Multicut Polytopes
• Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
• Complete linear descriptions of small asymmetric traveling salesman polytopes
• Projection results for the \(k\)-partition problem
• On the dominant of the multicut polytope
• A polyhedral study of lifted multicuts
• Exploiting sparsity for the min \(k\)-partition problem
• A Note on Clique-Web Facets for Multicut Polytopes

This page was built for publication:

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