A robust heuristic for the generalized assignment problem

DOI10.1007/BF02085655MaRDI QIDQ1339150zbMATH OpenFDO

Authors 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)

Recommendations

• A hybrid heuristic for the generalized assignment problem
• Solving the generalized assignment problem: an optimizing and heuristic approach
• Adaptive heuristic for the generalized assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• A tabu search heuristic for the generalized assignment problem
• An Effective Lagrangian Heuristic For The Generalized Assignment Problem
• Relaxation heuristics for a generalized assignment problem
• Heuristics for the multi-resource generalized assignment problem
• scientific article; zbMATH DE number 1960697
• scientific article; zbMATH DE number 40470

Cites work

• scientific article; zbMATH DE number 3989103 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• Algorithms for the Multi-Resource Generalized Assignment Problem
• Computer Solutions of the Traveling Salesman Problem

Cited in

(24)

• Size versus truncation robustness in the assignment problem
• Optimizing cane supply decisions within a sugar mill region
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• A path relinking approach with ejection chains for the generalized assignment problem
• On the variable-depth-search heuristic for the linear-cost generalized assignment problem
• Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
• Adaptive heuristic for the generalized assignment problem
• Branching rules for satisfiability
• Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
• Heuristics for the multi-resource generalized assignment problem
• A Survey of the Generalized Assignment Problem and Its Applications
• A variable depth search algorithm with branching search for the generalized assignment problem
• An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
• Double resource optimization for a robust computer network subject to a transmission budget
• A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
• scientific article; zbMATH DE number 1960697 (Why is no real title available?)
• Relaxation heuristics for a generalized assignment problem
• Very large-scale variable neighborhood search for the generalized assignment problem
• Bees algorithm for generalized assignment problem
• scientific article; zbMATH DE number 6796293 (Why is no real title available?)
• A dynamic tabu search for large-scale generalized assignment problems
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A hybrid heuristic for the generalized assignment problem
• Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339150)