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

DOI10.1016/S0167-6377(99)00029-2zbMATH Open0941.90072OpenAlexW1966088050MaRDI QIDQ1306454FDOQ1306454

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

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

polyhedral combinatoricsfacetsliftingclique partitioning

Mathematics Subject Classification ID

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

Recommendations

• The clique partitioning problem: Facets and patching facets
• Facets of the clique partitioning polytope
• Facets of the \(k\)-partition polytope
• Lifting facets of the cut polytope

Cites work

• scientific article; zbMATH DE number 3991298 (Why is no real title available?)
• scientific article; zbMATH DE number 3661343 (Why is no real title available?)
• scientific article; zbMATH DE number 15357 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1103047 (Why is no real title available?)
• Facets of the clique partitioning polytope
• The partition problem

Cited in

(14)

• Facet-defining inequalities for the simple graph partitioning polytope
• The clique partitioning problem: Facets and patching facets
• Clique facets of the axial and planar assignment polytopes
• A new lifting theorem for vertex packing
• The biclique partitioning polytope
• A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
• Projection results for the \(k\)-partition problem
• Disconnecting graphs by removing vertices: a polyhedral approach
• A polyhedral study of lifted multicuts
• Size-constrained graph partitioning polytopes
• scientific article; zbMATH DE number 3885658 (Why is no real title available?)
• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
• Facets of the clique partitioning polytope
• On the facets of the lift-and-project relaxations of graph subdivisions

This page was built for publication: Lifting theorems and facet characterization for a class of clique partitioning inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306454)