A low-dimensional semidefinite relaxation for the quadratic assignment problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1894380
- A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Bounds for the quadratic assignment problem using the bundle method
- Semidefinite programming relaxations for the quadratic assignment problem
Cited in
(32)- Semidefinite programming relaxations for the quadratic assignment problem
- Combinatorial optimization problems in engineering applications
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph
- Convex graph invariant relaxations for graph edit distance
- A note on convex relaxations for the inverse eigenvalue problem
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- An efficient semidefinite programming relaxation for the graph partition problem
- On new classes of nonnegative symmetric tensors
- Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming
- scientific article; zbMATH DE number 995811 (Why is no real title available?)
- On solving the quadratic shortest path problem
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Second order cone programming relaxation for quadratic assignment problems
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- scientific article; zbMATH DE number 714535 (Why is no real title available?)
- scientific article; zbMATH DE number 1786176 (Why is no real title available?)
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- scientific article; zbMATH DE number 1894380 (Why is no real title available?)
- A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling
- scientific article; zbMATH DE number 2200751 (Why is no real title available?)
- Algorithms – ESA 2005
- Recent approaches to the quadratic assignment problem
- Semidefinite approximations for quadratic programs over orthogonal matrices
- On Integrality in Semidefinite Programming for Discrete Optimization
- scientific article; zbMATH DE number 7716275 (Why is no real title available?)
- The Lovász theta function for recovering planted clique covers and graph colorings
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A new relaxation framework for quadratic assignment problems based on matrix splitting
This page was built for publication: A low-dimensional semidefinite relaxation for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169078)
