Heuristics for the multi‐resource generalized assignment problem
- 3 August 2001
- journal article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 48 (6), 468-483
- https://doi.org/10.1002/nav.1029
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Improving service productivityOR Insight, 1996
- An efficient preprocessing procedure for the multidimensional 0–1 knapsack problemDiscrete Applied Mathematics, 1994
- A survey of algorithms for the generalized assignment problemEuropean Journal of Operational Research, 1992
- A Multiplier Adjustment Method for the Generalized Assignment ProblemManagement Science, 1986
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$SIAM Journal on Scientific and Statistical Computing, 1986
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- On obtaining the ‘best’ multipliers for a lagrangean relaxation for integer programmingComputers & Operations Research, 1978
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977