Pages that link to "Item:Q3167623"
From MaRDI portal
The following pages link to Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm (Q3167623):
Displaying 7 items.
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs (Q1670994) (← links)
- Gap inequalities for the cut polytope (Q1911843) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)