A Generalization of the Perfect Graph Theorem Under the Disjunctive Index
From MaRDI portal
Publication:5704091
Recommendations
- Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “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
- The disjunctive procedure and blocker duality
Cited in
(17)- On the commutativity of antiblocker diagrams under lift-and-project operators
- scientific article; zbMATH DE number 2230198 (Why is no real title available?)
- scientific article; zbMATH DE number 2230212 (Why is no real title available?)
- scientific article; zbMATH DE number 2230211 (Why is no real title available?)
- 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
- Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality
- Clutter nonidealness
- On the relationship between disjunctive relaxations and minors in packing and covering problems
- A polyhedral approach to the stability of a family of coalitions
- On a certain class of nonideal clutters
- Comparing imperfection ratio and imperfection index for graph classes
- On determining the imperfection ratio
- A comparison between lift-and-project indices and imperfection ratio on web graphs
- An axiomatic duality framework for the theta body and related convex corners
- Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, “A Generalization of the Perfect Graph Theorem Under the Disjunctive Index”
This page was built for publication: 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 Q5704091)