A survey of algorithms for the generalized assignment problem
- 1 August 1992
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 60 (3), 260-272
- https://doi.org/10.1016/0377-2217(92)90077-m
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Improved Lagrangean decomposition: An application to the generalized assignment problemEuropean Journal of Operational Research, 1990
- An application-oriented guide for designing Lagrangean dual ascent algorithmsEuropean Journal of Operational Research, 1989
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignmentEuropean Journal of Operational Research, 1989
- A revised bound improvement sequence algorithmEuropean Journal of Operational Research, 1988
- Exact methods for the knapsack problem and its generalizationsEuropean Journal of Operational Research, 1987
- A new Lagrangian relaxation approach to the generalized assignment problemEuropean Journal of Operational Research, 1986
- Zero-one integer programs with few constraints —Efficient branch and bound algorithmsEuropean Journal of Operational Research, 1985
- Zero-one integer programs with few constraints —Lower bounding theoryEuropean Journal of Operational Research, 1985
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- An effective subgradient algorithm for the generalized assignment problemComputers & Operations Research, 1979