On the convergence of tabu search
From MaRDI portal
Publication:5933517
DOI10.1023/A:1026565712483zbMath0967.90054OpenAlexW1578484091MaRDI QIDQ5933517
Publication date: 3 September 2001
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026565712483
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (8)
Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem ⋮ Tabu search exploiting local optimality in binary optimization ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ Global optimizations and tabu search based on memory ⋮ Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List ⋮ Attraction probabilities in variable neighborhood search ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
This page was built for publication: On the convergence of tabu search