Separation problems for the stable set polytope

DOI10.1007/3-540-59408-6_42zbMath1498.05218OpenAlexW1562063303MaRDI QIDQ5101406

William H. Cunningham, Eddie Cheng

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_42

zbMATH Keywords

wheel inequalitieswheel configuration

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Fast separation for the three-index assignment problem ⋮ Faster separation of 1-wheel inequalities by graph products

Cites Work

• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Weakly bipartite graphs and the max-cut problem
• Geometric algorithms and combinatorial optimization.
• Wheel inequalities for stable set polytopes
• On certain polytopes associated with graphs
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Compositions of Graphs and Polyhedra II: Stable Sets
• Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor

This page was built for publication: Separation problems for the stable set polytope