A tabu search heuristic for the generalized assignment problem
From MaRDI portal
Publication:5938390
DOI10.1016/S0377-2217(00)00108-9zbMath0980.90045MaRDI QIDQ5938390
Publication date: 12 March 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
90B40: Search theory
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
The stochastic generalised assignment problem with Bernoulli demands, An LP-based heuristic procedure for the generalized assignment problem with special ordered sets, A simulated annealing approach to the traveling tournament problem, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, The capacity and distance constrained plant location problem, Finding good nurse duty schedules: a case study, An algorithm for the generalized quadratic assignment problem, A compact model and tight bounds for a combined location-routing problem, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Improved tabu search heuristics for the dynamic space allocation problem, A path relinking approach with ejection chains for the generalized assignment problem, Hybrid scatter search and path relinking for the capacitated \(p\)-median problem, An ejection chain approach for the generalized assignment problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- A survey of algorithms for the generalized assignment problem
- Relaxation heuristics for a generalized assignment problem
- A set partitioning heuristic for the generalized assignment problem
- A genetic algorithm for the generalised assignment problem
- Tabu search for the multilevel generalized assignment problem
- A property of assignment type mixed integer linear programming problems
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- An Ejection Chain Approach for the Generalized Assignment Problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Tabu Search—Part I
- Tabu Search—Part II
- A branch and bound algorithm for the generalized assignment problem
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A variable depth search algorithm with branching search for the generalized assignment problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers