On the Chvátal rank of linear relaxations of the stable set polytope
From MaRDI portal
Publication:3002564
DOI10.1111/j.1475-3995.2009.00744.xzbMath1231.05260OpenAlexW2077130519MaRDI QIDQ3002564
Eugenia Holm, Luis M. Torres, Annegret K. Wagler
Publication date: 20 May 2011
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00744.x
Related Items
$t$-Perfection in $P_5$-Free Graphs ⋮ Strengthening Chvátal-Gomory Cuts for the Stable Set Problem ⋮ A lower bound on the Chvátal-rank of Antiwebs
Cites Work
- Unnamed Item
- Unnamed Item
- The strong perfect graph theorem
- On cutting-plane proofs in combinatorial optimization
- A class of facet producing graphs for vertex packing polyhedra
- On certain polytopes associated with graphs
- Antiwebs are rank-perfect
- On rank-perfect subclasses of near-bipartite graphs
- Anti-blocking polyhedra
- Outline of an algorithm for integer solutions to linear programs
- Blocking and anti-blocking pairs of polyhedra