A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A branch and bound algorithm for the generalized assignment problem
1975
Mathematical programming
This paper describes what is termed the "generalized assignment problem". It is a generalization of the ordinary assignment problem of linear programming in which multiple assignments of tasks to agents are limited by some resource available to the agents. A branch and bound algorithm is developed that solves the generalized assignment problem by solving a series of binary knapsack problems to determine the bounds. Computational results are cited for problems with up to 4 000 0-1 variables, and comparisons are made with other algorithms.
doi:10.1007/bf01580430
fatcat:fcddvnfmcnannmuwfibdhkoztm