The Quadratic Assignment problem.
There are a set of n facilities and a set of n locations.
For each pair of locations, a distance is specified and for
each pair of facilities a weight or flow is specified
(e.g., the amount of supplies transported between the two facilities).
The problem is to assign all facilities to different locations
with the goal of minimizing the sum of the distances multiplied
by the corresponding flows.
Wikipedia.