Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem

DOI10.1137/S1052623499354904zbMath0990.90099MaRDI QIDQ2706327

Kurt M. Anstreicher

Publication date: 19 March 2001

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

semidefinite programmingquadratic assignment problemeigenvalue bounds

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27)

Related Items (3)

A survey for the quadratic assignment problem ⋮ Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps ⋮ Semidefinite programming for discrete optimization and matrix completion problems

Uses Software

• QAPLIB

This page was built for publication: Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem