Article ID: | iaor20052330 |
Country: | Netherlands |
Volume: | 33 |
Issue: | 2 |
Start Page Number: | 176 |
End Page Number: | 182 |
Publication Date: | Mar 2005 |
Journal: | Operations Research Letters |
Authors: | Alidaee Bahram, Kochenberger Gary, Lewis Mark |
Keywords: | allocation: resources |
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 illustrate the attractiveness of our approach.