Pages that link to "Item:Q1911843"
From MaRDI portal
The following pages link to Gap inequalities for the cut polytope (Q1911843):
Displaying 14 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)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Membership testing for Bernoulli and tail-dependence matrices (Q1795588) (← links)
- A note on convex reformulation schemes for mixed integer quadratic programs (Q2251547) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm (Q3167623) (← links)
- Valid inequalities and cutting planes for some polytopes (Q4392322) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
