Local search: Is brute-force avoidable?
Michael R. FellowsFedor V. FominDaniel LokshtanovFrances A. RosamondSaket SaurabhYngve VillangerPublished in: J. Comput. Syst. Sci. (2012)
Keyphrases
- brute force
- search algorithm
- exhaustive search
- search quality
- computationally expensive
- global search
- search space
- genetic algorithm
- simulated annealing
- locality sensitive hashing
- systematic search
- tabu search
- combinatorial optimization
- candidate set
- memetic algorithm
- optimal solution
- search procedure
- monte carlo
- satisfiability testing
- hill climbing
- search strategies
- evolutionary search
- evolutionary algorithm
- hybrid ga
- computer chess