Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming

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

zbMATH Keywords

semidefinite programming; singular value decomposition; relaxation; quadratic assignment problem; lower bound

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C22: Semidefinite programming

90C27: Combinatorial optimization

Related Items

A new relaxation framework for quadratic assignment problems based on matrix splitting

Uses Software

• QAPLIB
• SDPT3
• CVX