Hashing vectors for tabu search
From MaRDI portal
Publication:2366997
DOI10.1007/BF02022565zbMath0775.90294MaRDI QIDQ2366997
David L. Woodruff, Eitan Zemel
Publication date: 16 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
90C27: Combinatorial optimization
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Optimization of truss topology using tabu search, A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization, Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, A note on hashing functions and tabu search algorithms, Simulated annealing and tabu search: Lessons from a line search, Extensions of a tabu search adaptation to the quadratic assignment problem, Genetic algorithms and tabu search: Hybrids for optimization, Solving the continuous flow-shop scheduling problem by metaheuristics., The flow shop with parallel machines: A tabu search approach, Proposals for chunking and tabu search, Solving the medium newspaper production/distribution problem, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Local search with memory: Benchmarking RTS, Scatter search and star-paths: Beyond the genetic metaphor, Metaheuristics: A bibliography, A user's guide to tabu search, A tabu search experience in production scheduling, A scatter search heuristic for the capacitated clustering problem
Uses Software
Cites Work
- Algorithms for the maximum satisfiability problem
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- The tabu search metaheuristic: How we used it
- Some Convergence Results for Probabilistic Tabu Search
- Tabu Search Applied to the Quadratic Assignment Problem
- Unnamed Item
- Unnamed Item