TY  - BOOK
AU  - 
AU  - 
AU  - 
ED  - SpringerLink (Online service)
TI  - Theoretical Aspects of Local Search
T2  - Monographs in Theoretical Computer Science, An EATCS Series,
SN  - 9783540358541
AV  - QA76.9.M35 
U1  - 004.0151 23
PY  - 2007///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Information theory
KW  - Computer software
KW  - Artificial intelligence
KW  - Mathematical optimization
KW  - Computer Science
KW  - Mathematics of Computing
KW  - Algorithm Analysis and Problem Complexity
KW  - Theory of Computation
KW  - Artificial Intelligence (incl. Robotics)
KW  - Optimization
KW  - Operations Research/Decision Theory
N1  - Basic Examples -- Indirect Solution Representations -- Properties of Neighborhood Functions -- Performance Guarantees -- Time Complexity -- Metaheuristics -- Asymptotic Convergence of Simulated Annealing; ZDB-2-SCS
N2  - 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 problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature. This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search
UR  - http://dx.doi.org/10.1007/978-3-540-35854-1
ER  -