Pages that link to "Item:Q843394"
From MaRDI portal
The following pages link to Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework (Q843394):
Displaying 10 items.
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Semidefinite programming relaxations for the quadratic assignment problem (Q1386486) (← links)
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- Partial Lagrangian relaxation for general quadratic programming (Q2644374) (← links)
- On Lagrangian relaxation of quadratic matrix constraints (Q2706239) (← links)
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem (Q2706327) (← links)
- Semidefinite and Lagrangian relaxations for hard combinatorial problems (Q2712834) (← links)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
- Convex quadratic and semidefinite programming relaxations in scheduling (Q3196615) (← links)