Recent advances in the solution of quadratic assignment problems
- 1 July 2003
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 97 (1) , 27-42
- https://doi.org/10.1007/s10107-003-0437-z
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Solving large quadratic assignment problems on computational gridsMathematical Programming, 2002
- A new bound for the quadratic assignment problem based on convex quadratic programmingMathematical Programming, 2001
- Solving quadratic assignment problems using convex quadratic programming relaxationsOptimization Methods and Software, 2001
- 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 problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard casesMathematical Programming, 1998
- The Quadratic Assignment ProblemPublished by Springer Nature ,1998
- QAPLIB – A Quadratic Assignment Problem LibraryJournal of Global Optimization, 1997
- Lower bounds for the quadratic assignment problem via triangle decompositionsMathematical Programming, 1995