An extended formulation for the 1‐wheel inequalities of the stable set polytope
From MaRDI portal
Publication:6068534
DOI10.1002/net.21906OpenAlexW2980981565WikidataQ127019408 ScholiaQ127019408MaRDI QIDQ6068534
Bernd Perscheid, Ulf Friedrich, Sven de Vries
Publication date: 13 November 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21906
polyhedral combinatoricsextended formulationstable set problemgraph productseparation problemwheel inequalities
Related Items
Cites Work
- A new exact maximum clique algorithm for large and massive sparse graphs
- Extended formulations for independence polytopes of regular matroids
- Strong lift-and-project cutting planes for the stable set problem
- A branch and cut solver for the maximum stable set problem
- Faster separation of 1-wheel inequalities by graph products
- Finding maximum cliques in arbitrary and in special graphs
- Matrices with the Edmonds-Johnson property
- The ellipsoid method and its consequences in combinatorial optimization
- Using separation algorithms to generate mixed integer model reformulations
- Expressing combinatorial optimization problems by linear programs
- Geometric algorithms and combinatorial optimization
- A class of facet producing graphs for vertex packing polyhedra
- Separating subdivision of bicycle wheel inequalities over cut polytopes
- Wheel inequalities for stable set polytopes
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- Compact vs. exponential-size LP relaxations
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- Exploring the relationship between max-cut and stable set relaxations
- An effective compact formulation of the max cut problem on sparse graphs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Two extended formulations for cardinality maximum flow network interdiction problem
- On the facial structure of set packing polyhedra
- A catalog of steiner tree formulations
- Deriving compact extended formulations via LP-based separation techniques
- Extended formulations in combinatorial optimization
- A branch-and-cut algorithm for the maximum cardinality stable set problem
