Relaxation heuristics for a generalized assignment problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 40470
- Solving the generalized assignment problem: an optimizing and heuristic approach
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- A hybrid heuristic for the generalized assignment problem
- scientific article; zbMATH DE number 4199971
- Heuristics for the multi-resource generalized assignment problem
- Lagrangian heuristic for a class of the generalized assignment problems
- A robust heuristic for the generalized assignment problem
- Adaptive heuristic for the generalized assignment problem
- A new Lagrangian relaxation approach to the generalized assignment problem
Cites work
- A fast algorithm for the linear multiple-choice knapsack problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A surrogate heuristic for set covering problems
- A survey of algorithms for the generalized assignment problem
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
- An O(n) algorithm for the multiple-choice knapsack linear program
- Calculating surrogate constraints
- Exact methods for the knapsack problem and its generalizations
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Some relationships between lagrangian and surrogate duality in integer programming
- Surrogate Constraints
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(33)- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- A robust heuristic for the generalized assignment problem
- A hybrid heuristic for the generalized assignment problem
- Logic cuts for multilevel generalized assignment problems.
- A column generation approach to capacitated p-median problems
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- Optimizing cane supply decisions within a sugar mill region
- Lagrangean/surrogate relaxation for generalized assignment problems
- Heuristic solution methods for the multilevel generalized assignment problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Studying properties of Lagrangian bounds for many-to-many assignment problems
- A dual bounding scheme for a territory design problem
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- A genetic algorithm for the project assignment problem
- An ejection chain approach for the generalized assignment problem
- Optimal ABC inventory classification using interval programming
- Two stage decision making approach for sensor mission assignment problem
- scientific article; zbMATH DE number 4199971 (Why is no real title available?)
- Very large-scale variable neighborhood search for the generalized assignment problem
- Algorithms for the Multi-Resource Generalized Assignment Problem
- scientific article; zbMATH DE number 40470 (Why is no real title available?)
- scientific article; zbMATH DE number 1960697 (Why is no real title available?)
- Heuristics for the multi-resource generalized assignment problem
- A tabu search heuristic for the generalized assignment problem
- A dynamic tabu search for large-scale generalized assignment problems
- Matheuristics: survey and synthesis
- A Survey of the Generalized Assignment Problem and Its Applications
- Lagrangian heuristic for a class of the generalized assignment problems
- (Pareto)-optimization and greedy algorithm-based solutions for review and panel assignments
- Elitist genetic algorithm for assignment problem with imprecise goal
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- A Lagrangian bound for many-to-many assignment problems
This page was built for publication: Relaxation heuristics for a generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278258)
