The Quadratic Assignment Problem (QAP) is the problem of making exclusive assignments of n indivisible entities to n other indivisible entities in such a way that a total quadratic interaction cost is minimized. The problem can be interpreted from a wide variety of perspectives. The perspective adopted in this paper is that of the generic facilities location/layout context, as in the seminal wo...
