Gear Composition of Stable Set Polytopes and 𝒢-Perfection

DOI10.1287/MOOR.1090.0407zbMath1218.90172OpenAlexW2283748428MaRDI QIDQ3169068

Anna Galluccio, Claudio Gentile, Paolo Ventura

Publication date: 27 April 2011

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

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

zbMATH Keywords

stable set polytopepolyhedral combinatoricsgraph composition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect ⋮ The stable set polytope of icosahedral graphs ⋮ 2-clique-bond of stable set polyhedra ⋮ Unnamed Item ⋮ The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect ⋮ On the Stable Set Polytope of Claw-Free Graphs

Uses Software

• Octave
• PORTA

This page was built for publication: Gear Composition of Stable Set Polytopes and 𝒢-Perfection