, Volume 97, Issue 1-2, pp 27-42

Recent advances in the solution of quadratic assignment problems

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


 The quadratic assignment problem (QAP) is notoriously difficult for exact solution methods. In the past few years a number of long-open QAPs, including those posed by Steinberg (1961), Nugent et al. (1968) and Krarup (1972) were solved to optimality for the first time. The solution of these problems has utilized both new algorithms and novel computing structures. We describe these developments, as well as recent work which is likely to result in the solution of even more difficult instances.

Received: February 13, 2003 / Accepted: April 22, 2003 Published online: May 28, 2003
Key Words. quadratic assignment problem – discrete optimization – branch and bound
Mathematics Subject Classification (1991): 90C27, 90C09, 90C20