 Quadratic bottleneck assignment problem

The Quadratic Bottleneck Assignment Problem (QBAP) is an optimization problem that seeks to assign a set of agents to a set of tasks in such a way that the maximum cost associated with any assignment is minimized. It can be considered a generalization of the classic assignment problem, which focuses on minimizing the total cost of assignments without regard to the maximum individual costs. ### Problem Definition - **Agents**: A set of \( n \) agents (or workers).