| Article ID: | iaor20003722 |
| Country: | United States |
| Volume: | 45 |
| Issue: | 6 |
| Start Page Number: | 831 |
| End Page Number: | 841 |
| Publication Date: | Nov 1997 |
| Journal: | Operations Research |
| Authors: | Savelsbergh M. |
The generalized assignment problem examines the maximum profit assignment of jobs to agents such that each job is assigned to precisely one agent subject to capacity restrictions on the agents. A new algorithm for the generalized assignment problem is presented that employs both column generation and branch-and-bound to obtain optimal integer solutions to a set partitioning formulation of the problem.