Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index”

DOI10.1287/MOOR.28.4.884.20516MaRDI QIDQ5704155zbMATH OpenOpenAlexFDO

Authors A. M. H. Gerards, Gábor Maróti, Alexander Schrijver

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.28.4.884.20516

zbMATH Keywords

Perfect graphs, clique relaxation, disjunctive procedure, antiblocker duality

Mathematics Subject Classification ID

Perfect graphs (05C17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
• Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality
• Lift-and-project cuts and perfect graphs
• On the relationship between disjunctive relaxations and minors in packing and covering problems
• From conjecture to theorem

Cited in

(7)

• Lift-and-project ranks and antiblocker duality
• 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
• Comparing imperfection ratio and imperfection index for graph classes
• An axiomatic duality framework for the theta body and related convex corners
• A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
• scientific article; zbMATH DE number 2230212 (Why is no real title available?)

This page was built for publication: Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index”

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