Dynamic tabu list management using the reverse elimination method

Related Items

A user's guide to tabu search, Genetic algorithms and tabu search: Hybrids for optimization, Une approche hybride pour le sac à dos multidimensionnel en variables 0–1, An iterated ``hyperplane exploration approach for the quadratic knapsack problem, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Local search with memory: Benchmarking RTS, Dynamic tabu search strategies for the traveling purchaser problem, Genetic and hybrid algorithms for graph coloring, A Modified Binary Particle Swarm Optimization for Knapsack Problems, Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness, Global optimization and multi knapsack: a percolation algorithm., Modeling multiple plant sourcing decisions, The multidimensional 0-1 knapsack problem: an overview., Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem, Heuristic algorithms for the maximum diversity problem, Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, \(\text{MA}\mid\text{PM}\): memetic algorithms with population management, Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls, Improved results on the 0--1 multidimensional knapsack problem, Defining tabu list size and aspiration criterion within tabu search methods, Tabu search and finite convergence, Solving zero-one mixed integer programming problems using tabu search, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, The multidimensional 0-1 knapsack problem -- bounds and computational aspects

Uses Software

Tabu search

Cites Work