Bounds for the quadratic assignment problem using the bundle method
- 19 September 2006
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 109 (2-3) , 505-524
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Solving Lift-and-Project Relaxations of Binary Integer ProgramsSIAM Journal on Optimization, 2006
- Local Minima and Convergence in Low-Rank Semidefinite ProgrammingMathematical Programming, 2004
- Recent advances in the solution of quadratic assignment problemsMathematical Programming, 2003
- 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
- Linear Assignment Problems and Extensions1999
- The Quadratic Assignment Problem1998
- Solving Large Quadratic Assignment Problems in ParallelComputational Optimization and Applications, 1997
- QAPLIB – A Quadratic Assignment Problem LibraryJournal of Global Optimization, 1997
- Improved linear programming-based lower bounds for the quadratic assignment problem1994