Quadratic bottleneck assignment problem
In mathematics, the quadratic bottleneck assignment problem is one of fundamental combinatorial optimization problems in the branch of optimization or operations research, from the category of the facilities location problems.
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: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.
