Strengthened clique-family inequalities for the stable set polytope

DOI10.1016/j.orl.2021.06.008OpenAlexW3170760983MaRDI QIDQ2060608

Adam N. Letchford, Paolo Ventura

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.06.008

zbMATH Keywords

combinatorial optimizationpolyhedral combinatoricsstable set problem

Mathematics Subject Classification ID

Combinatorics (05-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
• A branch and cut solver for the maximum stable set problem
• The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
• MIR closures of polyhedral sets
• The stable set polytope of quasi-line graphs
• Gear composition and the stable set polytope
• On stable set polyhedra for K//(1,3)free graphs
• Geometric algorithms and combinatorial optimization
• A class of facet producing graphs for vertex packing polyhedra
• The maximum clique problem
• Wheel inequalities for stable set polytopes
• On certain polytopes associated with graphs
• Clique family inequalities for the stable set polytope of quasi-line graphs.
• Set packing relaxations of some integer programs
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Antiweb-wheel inequalities and their separation problems over the stable set polytopes
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
• Conflict graphs in solving integer programming problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• A note on the Chvátal-rank of clique family inequalities
• Outline of an algorithm for integer solutions to linear programs
• Generalized clique family inequalities for claw-free graphs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• On the facial structure of set packing polyhedra
• Maximum matching and a polyhedron with 0,1-vertices
• A branch-and-cut algorithm for the maximum cardinality stable set problem