Separating subdivision of bicycle wheel inequalities over cut polytopes

DOI10.1016/S0167-6377(98)00022-4zbMath0954.90068WikidataQ126781402 ScholiaQ126781402MaRDI QIDQ1306466

Eddie Cheng

Publication date: 9 February 2001

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

zbMATH Keywords

upper boundseparation algorithmmaximum cut problemcut polytopes

Mathematics Subject Classification ID

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

Related Items (6)

The Boolean Quadric Polytope ⋮ A note on the 2-circulant inequalities for the MAX-cut problem ⋮ Lifting and separation procedures for the cut polytope ⋮ An extended formulation for the 1‐wheel inequalities of the stable set polytope ⋮ Unnamed Item ⋮ A new separation algorithm for the Boolean quadric and cut polytopes

Cites Work

• Unnamed Item
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The cut polytope and the Boolean quadric polytope
• Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope
• On the cut polytope

This page was built for publication: Separating subdivision of bicycle wheel inequalities over cut polytopes