Pages that link to "Item:Q1373764"

The following pages link to Wheel inequalities for stable set polytopes (Q1373764):

Displaying 29 items.

• Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
• Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
• Faster separation of 1-wheel inequalities by graph products (Q496437) (← links)
• LP-oriented upper bounds for the weighted stability number of a graph (Q1040359) (← links)
• Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. (Q1417599) (← links)
• On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
• A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
• A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
• On the facets of the simple plant location packing polytope (Q1850113) (← links)
• Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
• Dynamic node packing (Q2097666) (← links)
• Facets from gadgets (Q2220662) (← links)
• A new lifting theorem for vertex packing (Q2329651) (← links)
• Tree-width and the Sherali-Adams operator (Q2386210) (← links)
• Fast separation for the three-index assignment problem (Q2398106) (← links)
• On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
• Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
• 2-clique-bond of stable set polyhedra (Q2446841) (← links)
• The wheels of the orthogonal Latin squares polytope: classification and valid inequalities (Q2583175) (← links)
• New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
• Separation problems for the stable set polytope (Q5101406) (← links)
• Clique-connecting forest and stable set polytopes (Q5189884) (← links)
• (Q5708566) (← links)
• New facets for the set packing polytope (Q5929145) (← links)
• An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)