Recommendations
- An extended formulation for the 1‐wheel inequalities of the stable set polytope
- On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- A smaller extended formulation for the odd cycle inequalities of the stable set polytope
- On cycles and the stable multi-set polytope
- Stable set polytopes in a higher dimensional space
- Strengthened clique-family inequalities for the stable set polytope
- Critical facets of the stable set polytope
- Stable Set Polytopes for a Class of Circulant Graphs
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
Cited in
(40)- Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope
- Faster separation of 1-wheel inequalities by graph products
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- A new lifting theorem for vertex packing
- New facets for the two-stage uncapacitated facility location polytope
- Fast separation for the three-index assignment problem
- On the stable set polytope of a series-parallel graph
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Optimum path packing on wheels: The consecutive case
- New facets for the set packing polytope
- On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes
- Strong lift-and-project cutting planes for the stable set problem
- LP-oriented upper bounds for the weighted stability number of a graph
- Separating subdivision of bicycle wheel inequalities over cut polytopes
- Polyhedral results for the bipartite induced subgraph problem
- Facets from gadgets
- Separation problems for the stable set polytope
- The wheels of the orthogonal Latin squares polytope: classification and valid inequalities
- Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.
- A branch-and-cut algorithm for the pallet loading problem
- The stable set problem: clique and nodal inequalities revisited
- On cycles and the stable multi-set polytope
- Solving VLSI design and DNA sequencing problems using bipartization of graphs
- The wheels of the OLS polytope: Facets and separation
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
- On the facets of the simple plant location packing polytope
- Dynamic node packing
- scientific article; zbMATH DE number 16720 (Why is no real title available?)
- scientific article; zbMATH DE number 2230274 (Why is no real title available?)
- Strengthened clique-family inequalities for the stable set polytope
- An extended formulation for the 1‐wheel inequalities of the stable set polytope
- scientific article; zbMATH DE number 1735804 (Why is no real title available?)
- On the mixed set covering, packing and partitioning polytope
- Clique-connecting forest and stable set polytopes
- 2-clique-bond of stable set polyhedra
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items
- Tree-width and the Sherali-Adams operator
This page was built for publication: Wheel inequalities for stable set polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373764)
