A branch and bound algorithm for the generalized assignment problem
- 1 December 1975
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 8 (1), 91-103
- https://doi.org/10.1007/bf01580430
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Multicommodity Distribution System Design by Benders DecompositionManagement Science, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Reduction Algorithm for Zero-One Single Knapsack ProblemsManagement Science, 1973
- An Algorithm for Assigning Uses to Sources in a Special Class of Transportation ProblemsOperations Research, 1973
- An all Zero-One Algorithm for a Certain Class of Transportation ProblemsOperations Research, 1971
- A Branch Search Algorithm for the Knapsack ProblemManagement Science, 1970
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- Topology and Computation of the Generalized Transportation ProblemManagement Science, 1964