Wheel inequalities for stable set polytopes
From MaRDI portal
Publication:1373764
zbMATH Open0891.90161MaRDI QIDQ1373764FDOQ1373764
Authors: Eddie Cheng, William H. Cunningham 
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
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
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cited In (39)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Dynamic node packing
- A new lifting theorem for vertex packing
- Strengthened clique-family inequalities for the stable set polytope
- New facets for the two-stage uncapacitated facility location polytope
- Facets from gadgets
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- On the stable set polytope of a series-parallel graph
- Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.
- Separating subdivision of bicycle wheel inequalities over cut polytopes
- The wheels of the orthogonal Latin squares polytope: classification and valid inequalities
- On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes
- A tutorial on branch and cut algorithms for the maximum stable set problem
- LP-oriented upper bounds for the weighted stability number of a graph
- Clique-connecting forest and stable set polytopes
- On the mixed set covering, packing and partitioning polytope
- Title not available (Why is that?)
- On cycles and the stable multi-set polytope
- Optimum path packing on wheels: The consecutive case
- 2-clique-bond of stable set polyhedra
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items
- A branch-and-cut algorithm for the pallet loading problem
- Strong lift-and-project cutting planes for the stable set problem
- Separation problems for the stable set polytope
- Solving VLSI design and DNA sequencing problems using bipartization of graphs
- Title not available (Why is that?)
- Polyhedral results for the bipartite induced subgraph problem
- Fast separation for the three-index assignment problem
- The stable set problem: clique and nodal inequalities revisited
- Tree-width and the Sherali-Adams operator
- Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope
- Faster separation of 1-wheel inequalities by graph products
- Title not available (Why is that?)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope
- The wheels of the OLS polytope: Facets and separation
- On the facets of the simple plant location packing polytope
- New facets for the set packing polytope
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets
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)
