Pages that link to "Item:Q3169078"
From MaRDI portal
The following pages link to A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem (Q3169078):
Displaying 6 items.
- Convex graph invariant relaxations for graph edit distance (Q2118089) (← links)
- A note on convex relaxations for the inverse eigenvalue problem (Q2230796) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
