Pages that link to "Item:Q2490329"
From MaRDI portal
The following pages link to Exploring the relationship between max-cut and stable set relaxations (Q2490329):
Displaying 12 items.
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- Facets from gadgets (Q2220662) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
