Solving quadratic assignment problems using convex quadratic programming relaxations

Optimization Methods and Software

Volumn 16, Issue 1-4, 2001, Pages 49-68

  Brixius, Nathan W ^a   Anstreicher, Kurt M ^b  

^a University of Iowa   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Branch and bound; Frank Wolfe algorithm; Quadratic assignment problem; Quadratic programming

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL METHODS; ITERATIVE METHODS; PROBLEM SOLVING; BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION;

QUADRATIC ASSIGNMENT PROBLEMS;

QUADRATIC PROGRAMMING;

BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL RESULTS; CONVEX QUADRATIC PROGRAMMING; FRANK-WOLFE ALGORITHMS; LINEAR ASSIGNMENT PROBLEM; PROGRAMMING RELAXATIONS; QUADRATIC ASSIGNMENT PROBLEMS; STATE OF THE ART; SUB-PROBLEMS;

EID: 0036454519     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. K.M. Anstreicher (2001). Eigenvalue bounds versus semidefinite programming for the quadratic assignment problem. SIAM J. Optimization, 11, 254-265.
2. K.M. Anstreicher and N.W. Brixius (2001). A new bound for the quadratic assignment problem based on convex quadratic programming. Mathematical Programming, 89, 341-357.
3. K.M. Anstreicher, N.W. Brixius, J.-P. Goux and J. Linderoth (2001). Solving large quadratic assignment problems on computational grids. Mathematical Programming, to appear.
4. K.M. Anstreicher and H. Wolkowicz (2000). On Lagrangian relaxation of quadratic matrix constraints. SIAM J. Matrix Analysis and Applications, 22, 41-55.
5. M.S. Bazaraa and O. Kirca (1983). A branch-and-bound based heuristic for solving the quadratic assignment problem. Naval Research Quarterly, 30, 287-304.
6. A. Brüngger, A. Marzetta, J. Clausen and M. Perregaard (1998). Solving large-scale QAP problems in parallel with the search library ZRAM. Journal of Parallel and Distributed Computing, 50, 157-169.
7. R.E. Burkard, E. Çela, P.M. Pardalos and L.S. Pitsoulis (1998). The quadratic assignment problem. In: D.-Z. Zhu and P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Vol. 3. Kluwer, Dordrecht.
8. R. Burkard and U. Derigs (1980). Assignment and Matching Problems: Solution Methods with FORTRAN Programs. Springer, Berlin.
9. R.E. Burkard, S. Karisch and F. Rendl (1997). QAPLIB - A quadratic assignment problem library. J. Global Optimization, 10, 391-403.
10. E. Çela (1998). The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Dordrecht.
11. J. Clausen, S.E. Karisch, M. Perregaard and F. Rendl (1998). On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel. Computational Optimization and Applications, 10, 127-147.
12. J. Clausen and M. Perregaard (1997). Solving large quadratic assignment problems in parallel. Computational Optimization and Applications, 8, 111-128.