Theoretical Aspects of Local Search

• Main Authors: Michiels, Wil (Author), Korst, Jan (Author), Aarts, Emile (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
• Series: Monographs in Theoretical Computer Science, An EATCS Series,
• Subjects: Mathematics.; Computers.; Algorithms.; Computer science > Mathematics.; Artificial intelligence.; Mathematical optimization.; Discrete mathematics.; Optimization.; Discrete Mathematics.; Mathematics of Computing.; Algorithm Analysis and Problem Complexity.; Theory of Computation.; Artificial Intelligence (incl. Robotics).

Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization pr...

Table of Contents:

• Basic Examples
• Indirect Solution Representations
• Properties of Neighborhood Functions
• Performance Guarantees
• Time Complexity
• Metaheuristics
• Asymptotic Convergence of Simulated Annealing.