most citedLinking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search

31 citations · 31 across the 1 of their papers we have counts for

collaborators

1 paper

cs.AI2011★ 31 cited

Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search

A. E. Howe, J. P. Watson, L. D. Whitley

Tabu search is one of the most effective heuristics for locating high-quality solutions to a diverse array of NP-hard combinatorial optimization problems. Despite the widespread su…