On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes
DOI10.1137/S0895480101391053zbMATH Open1055.90052OpenAlexW2015646376MaRDI QIDQ4785696FDOQ4785696
Authors: 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
Recommendations
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (12)
- A new facet generating procedure for the stable set polytope
- Wheel inequalities for stable set polytopes
- On a facet of the balanced subgraph polytope
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
- Facet-inducing web and antiweb inequalities for the graph coloring polytope
- Separation problems for the stable set polytope
- A class of web-based facets for the generalized vertex packing problem
- Faster separation of 1-wheel inequalities by graph products
- Title not available (Why is that?)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets
This page was built for publication: On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785696)
