| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524055 | Operations Research Letters | 2005 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mark Lewis, Bahram Alidaee, Gary Kochenberger,