scientific article; zbMATH DE number 17641

MaRDI QIDQ3974969zbMATH OpenFDO

Authors Martin Grötschel, Michel Deza, Monique Laurent

Publication date 26 June 1992

zbMATH Keywords

complete graphsenumeration of facetsinequalitiesmulticutpolyhedra

Mathematics Subject Classification ID

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

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

(13)

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

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)