A dynamic tabu search for large-scale generalized assignment problems
From MaRDI portal
Recommendations
Cites work
- A genetic algorithm for the generalised assignment problem
- A hybrid heuristic for the generalized assignment problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A robust heuristic for the generalized assignment problem
- A survey of algorithms for the generalized assignment problem
- A user's guide to tabu search
- A variation of the generalized assignment problem arising in the New Zealand dairy industry
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- scientific article; zbMATH DE number 40470 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Multiple-facility loading under capacity-based economies of scope
- Optimizing cane supply decisions within a sugar mill region
- Relaxation heuristics for a generalized assignment problem
- Solving real-life vehicle routing problems efficiently using tabu search
- Tabu search for the multilevel generalized assignment problem
Cited in
(18)- Tabu search for the multilevel generalized assignment problem
- Heuristic search to the capacitated clustering problem
- Tabu search for the dynamic bipartite drawing problem
- The dynamic space allocation problem: applying hybrid GRASP and tabu search metaheuristics
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
- A two-objective fuzzy \(k\)-cardinality assignment problem
- Improved tabu search heuristics for the dynamic space allocation problem
- Factory gate pricing: an analysis of the Dutch retail distribution
- An ejection chain approach for the generalized assignment problem
- Tabu search for target-radar assignment
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
- A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
- A tabu search heuristic 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
- A Survey of the Generalized Assignment Problem and Its Applications
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
This page was built for publication: A dynamic tabu search for large-scale generalized assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945334)