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 22 items.
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework (Q843394) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Semidefinite programming relaxations for the quadratic assignment problem (Q1386486) (← links)
- Combinatorial optimization problems in engineering applications (Q1627492) (← links)
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- 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)
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem (Q2706327) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- Second order cone programming relaxation for quadratic assignment problems (Q3514847) (← links)
- Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation (Q4609470) (← links)
- A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling (Q5300818) (← links)
- (Q5312513) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)