On the variable-depth-search heuristic for the linear-cost generalized assignment problem
From MaRDI portal
Publication:2752253
DOI10.1080/00207160108805083zbMath0990.90514OpenAlexW1992591614MaRDI QIDQ2752253
No author found.
Publication date: 16 October 2001
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160108805083
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- A genetic algorithm for the generalised assignment problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Resource-Constrained Assignment Scheduling
- Weighted Assignment Models and Their Application
- Algorithms for the Multi-Resource Generalized Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- Modeling Facility Location Problems as Generalized Assignment Problems
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem