Recent advances in the solution of quadratic assignment problems

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, Nugent et al. and Krarup 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 developements, as well as recent work which is likely to result in the solution of even more difficult instances.