Tabu search for the multilevel generalized assignment problem
From MaRDI portal
Publication:1388882
DOI10.1016/0377-2217(93)E0174-VzbMath0905.90122OpenAlexW2014617308MaRDI QIDQ1388882
Fred Glover, José Luis González-Velarde, James P. Kelly, Manuel Laguna
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0174-v
Related Items
Dynamic tabu list management using the reverse elimination method, Genetic algorithms and tabu search: Hybrids for optimization, Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems, An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion, Assignment problems: a golden anniversary survey, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, An implementation of exact knapsack separation, Constructing efficient simulated annealing algorithms, A simple dual algorithm for the generalised assignment problem, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, An LP-based heuristic procedure for the generalized assignment problem with special ordered sets, Ejection chains, reference structures and alternating path methods for traveling salesman problems, Metaheuristics: A bibliography, A simulated annealing approach to the traveling tournament problem, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, A Survey of the Generalized Assignment Problem and Its Applications, A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system, The equilibrium generalized assignment problem and genetic algorithm, Logic cuts for multilevel generalized assignment problems., Two heuristic solution concepts for the vehicle selection problem in line haul transports, The multidimensional 0-1 knapsack problem: an overview., Improved Lagrangian bounds and heuristics for the generalized assignment problem, Solving the wire-harness design problem at a European car manufacturer, Improved tabu search heuristics for the dynamic space allocation problem, A computational study of exact knapsack separation for the generalized assignment problem, A survey of very large-scale neighborhood search techniques, Optimization models for targeted offers in direct marketing: exact and heuristic algorithms, Convergence of the surrogate Lagrangian relaxation method, A tabu search heuristic for the generalized assignment problem, Bees algorithm for generalized assignment problem, Tabu search for a class of single-machine scheduling problems, A dynamic tabu search for large-scale generalized assignment problems, A dynamic vehicle routing problem with time-dependent travel times, Very large-scale variable neighborhood search for the generalized assignment problem, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, An algorithm for the generalized quadratic assignment problem, Optimizing cane supply decisions within a sugar mill region, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study, A path relinking approach with ejection chains for the generalized assignment problem, An ejection chain approach for the generalized assignment problem, Relaxed tours and path ejections for the traveling salesman problem, Global optimization for artificial neural networks: A tabu search application, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
Cites Work
- Unnamed Item
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
- Large-scale controlled rounding using tabu search with strategic oscillation
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- Bandwidth Packing: A Tabu Search Approach
