Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming
From MaRDI portal
Publication:3083337
DOI10.1137/090748834zbMath1211.90162MaRDI QIDQ3083337
Hans D. Mittelmann, Jiming Peng
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
semidefinite programming; singular value decomposition; relaxation; quadratic assignment problem; lower bound
90C35: Programming involving graphs or networks
90C22: Semidefinite programming
90C27: Combinatorial optimization
Related Items
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry, A new relaxation framework for quadratic assignment problems based on matrix splitting
Uses Software