Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs
From MaRDI portal
Publication:299078
DOI10.1016/j.dam.2015.11.001zbMath1339.05152arXiv1504.07888OpenAlexW750602481MaRDI QIDQ299078
F. Blanchet-Sadri, M. Dambrine
Publication date: 22 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07888
Cites Work
- Unnamed Item
- Polyhedral and semidefinite programming methods in combinatorial optimization
- On the behavior of the \(N_{+}\)-operator under blocker duality
- The strong perfect graph theorem
- On stable set polyhedra for K//(1,3)free graphs
- A class of facet producing graphs for vertex packing polyhedra
- Almost integral polyhedra related to certain combinatorial optimization problems
- The rank facets of the stable set polytope for claw-free graphs
- On certain polytopes associated with graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- The stable set problem and the lift-and-project ranks of graphs
- Antiwebs are rank-perfect
- Applying Lehman's theorems to packing problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Strength of facets for the set covering and set packing polyhedra on circulant matrices
- Comparing Imperfection Ratio and Imperfection Index for Graph Classes
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Stable Set Polytopes for a Class of Circulant Graphs
- Perfect zero–one matrices
- A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
