A robust heuristic for the generalized assignment problem

DOI10.1007/BF02085655zbMath0812.90097MaRDI QIDQ1339150

Mohammad M. Amini, Michael J. Racer

Publication date: 1 December 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

robustnessNP-hardgeneralized assignmentvariable-depth-search heuristic

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Double resource optimization for a robust computer network subject to a transmission budget, Branching rules for satisfiability, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS, A hybrid heuristic for the generalized assignment problem, A Survey of the Generalized Assignment Problem and Its Applications, Bees algorithm for generalized assignment problem, A dynamic tabu search for large-scale generalized assignment problems, Optimizing cane supply decisions within a sugar mill region, Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study, A path relinking approach with ejection chains for the generalized assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Algorithms for the Multi-Resource Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• Computer Solutions of the Traveling Salesman Problem