A new bound for the quadratic assignment problem based on convex quadratic programming
- 1 February 2001
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 89 (3) , 341-357
- https://doi.org/10.1007/pl00011402
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment ProblemSIAM Journal on Optimization, 2000
- On Lagrangian Relaxation of Quadratic Matrix ConstraintsSIAM Journal on Matrix Analysis and Applications, 2000
- A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on LinearizationComputing, 1999
- The Quadratic Assignment ProblemPublished by Springer Nature ,1998
- Semidefinite Programming Relaxations for the Quadratic Assignment ProblemJournal of Combinatorial Optimization, 1998
- QAPLIB – A Quadratic Assignment Problem LibraryJournal of Global Optimization, 1997