scientific article

zbMath0753.90066MaRDI QIDQ3972001

Martin Grötschel, Yoshiko Wakabayashi

Publication date: 25 June 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completenesscomplete graphclique partitioning polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

\(t\)-copula from the viewpoint of tail dependence matrices ⋮ A strong formulation for the graph partition problem ⋮ A polyhedral study of lifted multicuts ⋮ Binary positive semidefinite matrices and associated integer polytopes ⋮ Facet-defining inequalities for the simple graph partitioning polytope ⋮ Projection results for the \(k\)-partition problem ⋮ The Branch and Cut Method for the Clique Partitioning Problem ⋮ Lifting theorems and facet characterization for a class of clique partitioning inequalities

This page was built for publication: