A Generalization of the Perfect Graph Theorem Under the Disjunctive Index

DOI10.1287/moor.27.3.460.309zbMath1083.05505OpenAlexW2147471218MaRDI QIDQ5704091

Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini

Publication date: 11 November 2005

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

Full work available at URL: https://semanticscholar.org/paper/ca5af7045c1bedfea675d140ba8b862b87f83853

zbMATH Keywords

perfect graph, clique relaxation, disjunctive procedure, antiblocker duality

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Perfect graphs (05C17)

Related Items (14)

Comparing Imperfection Ratio and Imperfection Index for Graph Classes ⋮ Lift-and-project ranks and antiblocker duality ⋮ Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs ⋮ On the behavior of the \(N_{+}\)-operator under blocker duality ⋮ An axiomatic duality framework for the theta body and related convex corners ⋮ A polyhedral approach to the stability of a family of coalitions ⋮ Unnamed Item ⋮ Clutter nonidealness ⋮ On the commutativity of antiblocker diagrams under lift-and-project operators ⋮ On a certain class of nonideal clutters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On determining the imperfection ratio

This page was built for publication: A Generalization of the Perfect Graph Theorem Under the Disjunctive Index