On the commutativity of antiblocker diagrams under lift-and-project operators
From MaRDI portal
Publication:2500533
Recommendations
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs
- Lift-and-project ranks and antiblocker duality
- The stable set problem and the lift-and-project ranks of graphs
- On the polyhedral lift-and-project methods and the fractional stable set polytope
- A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
Cites work
- scientific article; zbMATH DE number 2230212 (Why is no real title available?)
- A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Applying Lehman's theorems to packing problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Geometric algorithms and combinatorial optimization
- Lift and project relaxations for the matching and related polytopes
- Maximum matching and a polyhedron with 0,1-vertices
- Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index”
- On a representation of the matching polytope via semidefinite liftings
- On certain polytopes associated with graphs
- On the relationship between disjunctive relaxations and minors in packing and covering problems
- The stable set problem and the lift-and-project ranks of graphs
Cited in
(3)
This page was built for publication: On the commutativity of antiblocker diagrams under lift-and-project operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500533)