A Tabu search heuristic for the generalized assignment problem
- 1 July 2001
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 132 (1) , 22-38
- https://doi.org/10.1016/s0377-2217(00)00108-9
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A variable depth search algorithm with branching search for the generalized assignment problemOptimization Methods and Software, 1998
- A genetic algorithm for the generalised assignment problemComputers & Operations Research, 1997
- Relaxation heuristics for a generalized assignment problemEuropean Journal of Operational Research, 1996
- Heuristics for the generalised assignment problem: simulated annealing and tabu search approachesOR Spectrum, 1995
- Tabu search for the multilevel generalized assignment problemEuropean Journal of Operational Research, 1995
- A survey of algorithms for the generalized assignment problemEuropean Journal of Operational Research, 1992
- Improved Lagrangean decomposition: An application to the generalized assignment problemEuropean Journal of Operational Research, 1990
- A new Lagrangian relaxation approach to the generalized assignment problemEuropean Journal of Operational Research, 1986
- A property of assignment type mixed integer linear programming problemsOperations Research Letters, 1983
- An effective subgradient algorithm for the generalized assignment problemComputers & Operations Research, 1979