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 Journal of the Operational Research Society, Vol. 55, No. 7, Part Special Issue: Local Search (Jul., 2004), pp. 694-704 (11 pages) The multi-index assignment problem (MIAP) with decomposable costs ...
This example departs somewhat from the emphasis of previous ones. Typically, linear programming models are large, have considerable structure, and are solved with some regularity. Some form of ...