Pages that link to "Item:Q5101410"
From MaRDI portal
The following pages link to Combining semidefinite and polyhedral relaxations for integer programs (Q5101410):
Displaying 5 items.
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)