Pages that link to "Item:Q2706327"
From MaRDI portal
The following pages link to Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem (Q2706327):
Displaying 5 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Semidefinite programming relaxations for the quadratic assignment problem (Q1386486) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)