A hybrid algorithm for the generalized assignment problem
From MaRDI portal
Publication:3348709
Recommendations
- A hybrid heuristic for the generalized assignment problem
- An approximation algorithm for the generalized assignment problem
- An efficient algorithm for a class of generalized assignment problem
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- An efficient approximation for the generalized assignment problem
- A survey of algorithms for the generalized assignment problem
- A class of greedy algorithms for the generalized assignment problem
- The generalized assignment problem
- scientific article; zbMATH DE number 3918100
- An algorithm for the bottleneck generalized assignment problem
Cites work
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- A tree-search algorithm for mixed integer programming problems
- An Automatic Method of Solving Discrete Programming Problems
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
- Facets of the Knapsack Polytope From Minimal Covers
- Facets of the knapsack polytope
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Technical Note—A Note on Zero-One Programming
Cited in
(9)- scientific article; zbMATH DE number 5556493 (Why is no real title available?)
- A survey of algorithms for the generalized assignment problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A hybrid heuristic for the generalized assignment problem
- A simple dual algorithm for the generalised assignment problem
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- An approximation algorithm for the generalized assignment problem
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
This page was built for publication: A hybrid algorithm for the generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348709)