Separation routine and extended formulations for the stable set problem in claw-free graphs
From MaRDI portal
Publication:2039230
DOI10.1007/s10107-020-01502-4zbMath1470.90051OpenAlexW3022346223MaRDI QIDQ2039230
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
Publication date: 2 July 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01502-4
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- The stable set polytope of quasi-line graphs
- Claw-free graphs. V. Global structure
- On facets of stable set polytopes of claw-free graphs with stability number 3
- Gear composition and the stable set polytope
- On maximal independent sets of vertices in claw-free graphs
- Using separation algorithms to generate mixed integer model reformulations
- Geometric algorithms and combinatorial optimization
- Competitive algorithms for multistage online scheduling
- A cutting plane algorithm for minimum perfect 2-matchings
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Branched Polyhedral Systems
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Odd Minimum Cut-Sets and b-Matchings
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- The Matching Polytope has Exponential Extension Complexity
- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
- Maximum matching and a polyhedron with 0,1-vertices
This page was built for publication: Separation routine and extended formulations for the stable set problem in claw-free graphs
