A note on hashing functions and tabu search algorithms
From MaRDI portal
Publication:1278383
DOI10.1016/0377-2217(95)00249-9zbMath0953.90528OpenAlexW2051001005MaRDI QIDQ1278383
J. Wesley Barnes, William B. Carlton
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00249-9
Related Items (8)
A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization ⋮ A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem ⋮ Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking ⋮ Effective metaheuristic algorithms for the minimum differential dispersion problem ⋮ Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
Cites Work
This page was built for publication: A note on hashing functions and tabu search algorithms
