On the commutativity of antiblocker diagrams under lift-and-project operators

DOI10.1016/j.dam.2006.03.026zbMath1099.05074MaRDI QIDQ2500533

Mariana S. Escalante, Graciela L. Nasini, M. C. Varaldo

Publication date: 17 August 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.026

zbMATH Keywords

stable set problem; antiblocker duality; disjunctive rank

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

On the behavior of the \(N_{+}\)-operator under blocker duality

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• On certain polytopes associated with graphs
• Lift and project relaxations for the matching and related polytopes
• The stable set problem and the lift-and-project ranks of graphs
• Applying Lehman's theorems to packing problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• On a Representation of the Matching Polytope Via Semidefinite Liftings
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Maximum matching and a polyhedron with 0,1-vertices
• A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
• Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index”