A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem

Abstract

In this paper a binary branch and bound algorithm for the exact solution of the Koopmans-Beckmann quadratic assignment problem is described which exploits both the transformation and the greedily obtained approximate solution described in a previous paper by the author. This branch and bound algorithm has the property that at each bound an associated solution is obtained simultaneously, thereby rendering any premature termination of the algorithm less wasteful.