scientific article; zbMATH DE number 15357
zbMATH Open0753.90066MaRDI QIDQ3972001FDOQ3972001
Authors: Martin Grötschel, Yoshiko Wakabayashi 
Publication date: 25 June 1992
Title of this publication is not available (Why is that?)
Recommendations
Linear programming (90C05) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Abstract computational complexity for mathematical programming problems (90C60) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (16)
- Facet-defining inequalities for the simple graph partitioning polytope
- \(t\)-copula from the viewpoint of tail dependence matrices
- Redundant constraints in the standard formulation for the clique partitioning problem
- A linear programming formulation for the maximum complete multipartite subgraph problem
- The clique partitioning problem: Facets and patching facets
- Binary positive semidefinite matrices and associated integer polytopes
- The branch and cut method for the clique partitioning problem
- Facets of the clique partitioning polytope
- Projection results for the \(k\)-partition problem
- A cutting plane algorithm for a clustering problem
- A polyhedral study of lifted multicuts
- A strong formulation for the graph partition problem
- Clique facets of the axial and planar assignment polytopes
- Lifting theorems and facet characterization for a class of clique partitioning inequalities
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
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)
