Pages that link to "Item:Q2712834"
From MaRDI portal
The following pages link to Semidefinite and Lagrangian relaxations for hard combinatorial problems (Q2712834):
Displaying 9 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)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
- The Lagrangian relaxation for the combinatorial integral approximation problem (Q2943809) (← links)
- (Q4414639) (← links)
- (Q4818837) (← links)
- (Q5053241) (← links)
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)