1-Persistency of the Clique Relaxation of the Stable Set Polytope
- 22 May 2024
- book chapter
- Published by Springer Nature
- p. 71-84
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Persistency of linear programming relaxations for the stable set problemMathematical Programming, 2021
- The strong perfect graph theoremAnnals of Mathematics, 2006
- Rank-perfect and" weakly rank-perfect graphsMathematical Methods of Operations Research, 2002
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975