A hybrid heuristic for the generalized assignment problem

DOI10.1016/0377-2217(94)00154-5zbMath0914.90222OpenAlexW2091620788MaRDI QIDQ1390290

Mohammad M. Amini, Michael J. Racer

Publication date: 14 July 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00154-5

zbMATH Keywords

hybrid heuristicgeneralized assignmentvariable-depth-search

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (10)

A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem ⋮ Multi-neighborhood local search optimization for machine reassignment problem ⋮ Two stage decision making approach for Sensor Mission Assignment Problem ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ Logic cuts for multilevel generalized assignment problems. ⋮ A dynamic tabu search for large-scale generalized assignment problems ⋮ A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem ⋮ Optimizing cane supply decisions within a sugar mill region ⋮ Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• A survey of algorithms for the generalized assignment problem
• A robust heuristic for the generalized assignment problem
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem

This page was built for publication: A hybrid heuristic for the generalized assignment problem