scientific article; zbMATH DE number 17641

MaRDI QIDQ3974969zbMATHFDO

Authors Martin Grötschel, Michel Deza, Monique Laurent

Publication date 26 June 1992

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)

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

Cited in

(12)

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

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)