Local Search: Is Brute-Force Avoidable?

Michael R. Fellows Frances A. Rosamond Fedor V. Fomin Daniel Lokshtanov Saket Saurabh Yngve Villanger

Published in: IJCAI (2009)

Keyphrases

brute force
search algorithm
exhaustive search
tabu search
computationally expensive
search space
genetic algorithm

hybrid ga
memetic algorithm
global search
search quality
search procedure
combinatorial optimization

job shop scheduling problem
computer chess
locality sensitive hashing
hill climbing
stochastic local search
domain independent planning

satisfiability testing
systematic search
neighborhood search
candidate set
linear programming
optimal solution