scientific article
From MaRDI portal
Publication:3974969
zbMath0737.52007MaRDI QIDQ3974969
Martin Grötschel, Michel Marie Deza, Monique Laurent
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial optimization (90C27) Enumeration in graph theory (05C30)
Related Items
Complete linear descriptions of small asymmetric traveling salesman polytopes, Exploiting sparsity for the min \(k\)-partition problem, Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations, New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, A polyhedral study of lifted multicuts, Projection results for the \(k\)-partition problem, The inequicut cone, The even and odd cut polytopes
