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.20516zbMath1082.05504OpenAlexW2133903958MaRDI QIDQ5704155

Gábor Maróti, A. M. H. Gerards, 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

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

Related Items (6)

Comparing Imperfection Ratio and Imperfection Index for Graph Classes ⋮ Lift-and-project ranks and antiblocker duality ⋮ An axiomatic duality framework for the theta body and related convex corners ⋮ On the commutativity of antiblocker diagrams under lift-and-project operators ⋮ Unnamed Item ⋮ Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality

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”