On the behavior of the N_+-operator under blocker duality
From MaRDI portal
Publication:628328
Recommendations
- Lift-and-project ranks and antiblocker duality
- Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality
- The disjunctive procedure and blocker duality
- Lift-and-project ranks of the set covering polytope of circulant matrices
- The stable set problem and the lift-and-project ranks of graphs
Cites work
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (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
- Combinatorial optimization. Packing and covering
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Ideal 0, 1 matrices
- Normal hypergraphs and the perfect graph conjecture
- On certain polytopes associated with graphs
- On the commutativity of antiblocker diagrams under lift-and-project operators
- On the width—length inequality
- The disjunctive procedure and blocker duality
- The stable set problem and the lift-and-project ranks of graphs
Cited in
(3)
This page was built for publication: On the behavior of the \(N_{+}\)-operator under blocker duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628328)