An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...

The method differs from general convex programming methods by terminating in a finite number of iterations and is actually an application of the Simplex and dual methods for quadratic programming to ...