Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming
DOI10.1137/090748834zbMATH Open1211.90162OpenAlexW2028920274MaRDI QIDQ3083337FDOQ3083337
Jiming Peng, Hans D. Mittelmann
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090748834
Recommendations
- A low-dimensional semidefinite relaxation for the quadratic assignment problem
- scientific article; zbMATH DE number 1894380
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem
singular value decompositionquadratic assignment problemsemidefinite programminglower boundrelaxation
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Semidefinite programming (90C22)
Cited In (9)
- Characteristics of the Distribution of Hamming Distance Values Between Multidimensional Assignment Problem Solutions
- On solving a hard quadratic 3-dimensional assignment problem
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- A new relaxation framework for quadratic assignment problems based on matrix splitting
Uses Software
This page was built for publication: Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083337)
