Theoretical aspects of local search
Combinatorial optimization Heuristic programming sähkökirjat
Springer
2007
EISBN 9783540358541
Introduction; Basic Examples; Indirect Solution Representations; Properties of Neighborhood Functions; Performance Guarantees; Time Complexity; Metaheuristics; Asymptotic Convergence of Simulated Annealing.
Local search has been applied successively to a diverse collection of optimization problems, and in many cases with considerable success. Serving as a source of inspiration for the development of novel results in the challenging field of local search, this book presents a large collection of theoretical results.
Local search has been applied successively to a diverse collection of optimization problems, and in many cases with considerable success. Serving as a source of inspiration for the development of novel results in the challenging field of local search, this book presents a large collection of theoretical results.
