Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. Balachandran, “An integer generalized transportation model for optimal job assignment in computer networks”, Working Paper 34-72-3, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pa. (November, 1972).
A. Charnes, W.W. Cooper, D. Klingman and R. Niehaus, “Static and dynamic biased quadratic multi-attribute assignment models: solutions and equivalents”, Center for Cybernetic Studies, Research Report CS 115, The University of Texas, Austin, Texas (January, 1973).
R.J. Dakin, “A tree search algorithm for mixed integer programming problems”,Computer Journal 8 (3) (1965) 250–255.
A. DeMaio and C. Roveda, “An all zero–one algorithm for a certain class of transportation problems”,Operations Research 19 (6) (1971) 1406–1418.
A.M. Geoffrion, “An improved implicit enumeration approach for integer programming”,Operations Research 17 (3) (1969) 437–454.
A.M. Geoffrion, “Lagrangean relaxation for integer programming”,Mathematical Programming Study 2 (1974) 82–114.
A.M. Geoffrion and G.W. Graves, “Multicommodity distribution system design by benders decomposition”,Management Science 20 (5) (1974) 822–844.
H. Greenberg and R.L. Hegerich, “A branch search algorithm for the knapsack problem”,Management Science 16 (5) (1970) 327–332.
M.D. Grigoriadis, D.T. Tang and L.S. Woo, “Considerations in the optimal synthesis of some communication networks”, Presented at the 45th Joint National Meeting of the Operations Research Society of America and The Institute of Management Sciences, Boston, Mass., April 22–24, 1974.
D. Gross and C.E. Pinkus, “Optimal allocation of ships to yards for regular overhauls”, Tech. Memorandum 63095, Institute for Management Science and Engineering, The George Washington University, Washington, D.C. (May, 1972).
G.P. Ingargiola and J.F. Korsh, “Reduction algorithm for zero–one single knapsack problems”,Management Science 20 (4) Part I (1973) 460–463.
D. Klingman and J. Stutz, “Computational testing on an integer generalized network code”, Presented at the 45th Joint National Meeting of the Operations Research Society of America and The Institute of Management Sciences, Boston, Mass., April 22–24, 1974.
J.R. Lourie, “Topology and computation of the generalized transportation problem”,Management Science 11 (1) (1964) 177–187.
V. Srinivasan and G. Thompson, “An algorithm for assigning uses to sources in a speical class of transportation problems”,Operations Research 21 (1) (1973) 284–295.
Author information
Authors and Affiliations
Additional information
This research was partly supported by ONR Contracts N00014-67-A-0126-0008 and N00014-67-A-0126-0009 with the Center for Cybernetic Studies, The University of Texas.
Rights and permissions
About this article
Cite this article
Ross, G.T., Soland, R.M. A branch and bound algorithm for the generalized assignment problem. Mathematical Programming 8, 91–103 (1975). https://doi.org/10.1007/BF01580430
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580430