On the behavior of the N_+-operator under blocker duality
From MaRDI portal
Publication:628328
DOI10.1016/J.DAM.2010.11.023zbMATH Open1207.90084OpenAlexW2028538202MaRDI QIDQ628328FDOQ628328
Authors: Silvia M. Bianchi, Mariana S. Escalante, G. 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
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
Combinatorial optimization (90C27) Integer programming (90C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Cites Work
- Normal hypergraphs and the perfect graph conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- On certain polytopes associated with graphs
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Ideal 0, 1 matrices
- The stable set problem and the lift-and-project ranks of graphs
- Combinatorial optimization. Packing and covering
- On the width—length inequality
- A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
- The disjunctive procedure and blocker duality
- On the commutativity of antiblocker diagrams under lift-and-project operators
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)
