Quadratic bottleneck assignment problem
From HandWiki
In mathematics, the quadratic bottleneck assignment problem (QBAP) is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research, from the category of the facilities location problems.[1] It is related to the quadratic assignment problem in the same way as the linear bottleneck assignment problem is related to the linear assignment problem, the "sum" is replaced with "max" in the objective function.
The problem models the following real-life 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 maximum of the distances multiplied by the corresponding flows.
Computational complexity
The problem is NP-hard, as it can be used to formulate the Hamiltonian cycle problem by using flows in the pattern of a cycle and distances that are short for graph edges and long for non-edges.[2]
Special cases
- Bottleneck traveling salesman problem
- Graph bandwidth problem
References
- ↑ Assignment Problems, by Rainer Burkard, Mauro Dell'Amico, Silvano Martello, 2009
- ↑ Burkard, R. E.; Fincke, U. (1982), "On random quadratic bottleneck assignment problems", Mathematical Programming 23 (2): 227–232, doi:10.1007/BF01583791.
 |  |
