Wheel inequalities for stable set polytopes
From MaRDI portal
Publication:1373764
zbMath0891.90161MaRDI QIDQ1373764
Eddie Cheng, William H. Cunningham
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items (29)
Tree-width and the Sherali-Adams operator ⋮ Fast separation for the three-index assignment problem ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming ⋮ The stable set problem: clique and nodal inequalities revisited ⋮ Strong lift-and-project cutting planes for the stable set problem ⋮ Cover by disjoint cliques cuts for the knapsack problem with conflicting items ⋮ On the complete set packing and set partitioning polytopes: properties and rank 1 facets ⋮ Separation problems for the stable set polytope ⋮ An extended formulation for the 1‐wheel inequalities of the stable set polytope ⋮ Solving VLSI design and DNA sequencing problems using bipartization of graphs ⋮ Polyhedral results for the bipartite induced subgraph problem ⋮ Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. ⋮ 2-clique-bond of stable set polyhedra ⋮ Facets from gadgets ⋮ Faster separation of 1-wheel inequalities by graph products ⋮ On the mixed set covering, packing and partitioning polytope ⋮ A tutorial on branch and cut algorithms for the maximum stable set problem ⋮ New facets for the set packing polytope ⋮ Clique-connecting forest and stable set polytopes ⋮ A branch-and-cut algorithm for the pallet loading problem ⋮ A polyhedral study on 0-1 knapsack problems with set packing constraints ⋮ Strengthened clique-family inequalities for the stable set polytope ⋮ Unnamed Item ⋮ LP-oriented upper bounds for the weighted stability number of a graph ⋮ A new lifting theorem for vertex packing ⋮ On the facets of the simple plant location packing polytope ⋮ Dynamic node packing ⋮ The wheels of the orthogonal Latin squares polytope: classification and valid inequalities
This page was built for publication: Wheel inequalities for stable set polytopes
