On the behavior of the \(N_{+}\)-operator under blocker duality
From MaRDI portal
Publication:628328
DOI10.1016/j.dam.2010.11.023zbMath1207.90084OpenAlexW2028538202MaRDI QIDQ628328
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.023
Integer programming (90C10) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs ⋮ Lift-and-project ranks of the set covering polytope of circulant matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Ideal 0, 1 matrices
- On certain polytopes associated with graphs
- The stable set problem and the lift-and-project ranks of graphs
- The disjunctive procedure and blocker duality
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the commutativity of antiblocker diagrams under lift-and-project operators
- Normal hypergraphs and the perfect graph conjecture
- Combinatorial Optimization
- On the width—length inequality
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A Generalization of the Perfect Graph Theorem Under the Disjunctive Index