On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes

DOI10.1137/S0895480101391053zbMath1055.90052OpenAlexW2015646376MaRDI QIDQ4785696

Eddie Cheng, Sven de Vries

Publication date: 5 January 2003

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480101391053

zbMATH Keywords

cutting planesstable setsfacetspolyhedral combinatoricswheelsantiwebs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Facet-inducing web and antiweb inequalities for the graph coloring polytope ⋮ On the complete set packing and set partitioning polytopes: properties and rank 1 facets ⋮ Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope

This page was built for publication: On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes