Lewis, Mark, Alidaee, Bahram and Kochenberger, Gary
Operations Research Letters Vol. 33, Issue 2, p. 176-182

This paper illustrates how large instances of the unconstrained task allocation problem can be effectively modeled and efficiently solved as unconstrained quadratic binary programs. Computational experience and a comparison to the state-of-the-art commercial code (CPLEX) illustrate the attractiveness of our approach.