scientific article; zbMATH DE number 15357

MaRDI QIDQ3972001zbMATH OpenFDO

Authors Martin Grötschel, Yoshiko Wakabayashi

Publication date 25 June 1992

zbMATH Keywords

clique partitioning polytopecomplete graphNP-completeness

Mathematics Subject Classification ID

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

Recommendations

• Facets of the clique partitioning polytope
• The clique partitioning problem: Facets and patching facets
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• scientific article; zbMATH DE number 36207
• Clique-Web Facets for Multicut Polytopes

Cited in

(21)

• Clique facets of the axial and planar assignment polytopes
• A cutting plane algorithm for a clustering problem
• Lifting theorems and facet characterization for a class of clique partitioning inequalities
• Projection results for the \(k\)-partition problem
• t-copula from the viewpoint of tail dependence matrices
• Redundant constraints in the standard formulation for the clique partitioning problem
• On the complete set packing and set partitioning polytopes: properties and rank 1 facets
• Facet-defining inequalities for the simple graph partitioning polytope
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• A linear programming formulation for the maximum complete multipartite subgraph problem
• A polyhedral study of lifted multicuts
• scientific article; zbMATH DE number 36207 (Why is no real title available?)
• scientific article; zbMATH DE number 1103047 (Why is no real title available?)
• The clique partitioning problem: Facets and patching facets
• The branch and cut method for the clique partitioning problem
• A strong formulation for the graph partition problem
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
• Binary positive semidefinite matrices and associated integer polytopes
• Chorded cycle facets of the clique partitioning polytope
• New facets of the clique partitioning polytope
• Facets of the clique partitioning polytope

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 Q3972001)