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

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

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

polyhedral combinatoricsfacetsliftingclique partitioning

Mathematics Subject Classification ID

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

Cites Work

• Facets of the clique partitioning polytope
• The partition problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

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