On the relationship between disjunctive relaxations and minors in packing and covering problems

MaRDI QIDQ5476491zbMATH OpenFDO

Authors V. Leoni, G. Nasini

Publication date 14 July 2006

zbMATH Keywords

blocking and antiblocking dualitycovering and packing polyhedraperfect graph theorem

Mathematics Subject Classification ID

Perfect graphs (05C17) Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Recommendations

• Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality
• Lift and project relaxations for the matching and related polytopes
• Packing and covering with linear programming: a survey
• A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
• Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs

Cited in

(7)

• On the commutativity of antiblocker diagrams under lift-and-project operators
• Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality
• Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
• 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”
• scientific article; zbMATH DE number 2230211 (Why is no real title available?)
• Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture

This page was built for publication: On the relationship between disjunctive relaxations and minors in packing and covering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5476491)