Lifting theorems and facet characterization for a class of clique partitioning inequalities

DOI10.1016/S0167-6377(99)00029-2zbMath0941.90072OpenAlexW1966088050MaRDI QIDQ1306454

Maarten Oosten, Jeroen H. G. C. Rutten, Frits C. R. Spieksma, Hans-Jürgen Bandelt

Publication date: 19 December 1999

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00029-2

zbMATH Keywords

liftingfacetspolyhedral combinatoricsclique partitioning

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

The clique partitioning problem: Facets and patching facets, Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables, Size-constrained graph partitioning polytopes, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, A polyhedral study of lifted multicuts, Facet-defining inequalities for the simple graph partitioning polytope, Projection results for the \(k\)-partition problem, Disconnecting graphs by removing vertices: a polyhedral approach, The biclique partitioning polytope

Cites Work

• Facets of the clique partitioning polytope
• The partition problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item