Gary Kochenberger, Fred Glover
Journal of Heuristics,Vol. 19, Issue 4, Pages: 525-528.
The Unconstrained Binary Quadratic Programming (UBQP) problem is notable for encompassing a remarkable range of applications in combinatorial optimization. As observed in Kochenberger et al.(2013), classes of problems that can be formally expressed using UBQP formulations include: Quadratic Assignment Problems, Capital Budgeting Problems, Multiple Knapsack Problems, Task Allocation Problems (distributed computer systems), Maximum Diversity Problems, P-Median Problems, Asymmetric Assignment …