Theoretical Aspects of Local Search

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...

Full description

Bibliographic Details
Main Authors: Michiels, Wil, Aarts, Emile (Author), Korst, Jan (Author)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2007, 2007
Edition:1st ed. 2007
Series:Monographs in Theoretical Computer Science. An EATCS Series
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02431nmm a2200409 u 4500
001 EB000376458
003 EBX01000000000000000229510
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540358541 
100 1 |a Michiels, Wil 
245 0 0 |a Theoretical Aspects of Local Search  |h Elektronische Ressource  |c by Wil Michiels, Emile Aarts, Jan Korst 
250 |a 1st ed. 2007 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2007, 2007 
300 |a VIII, 238 p. 70 illus  |b online resource 
505 0 |a Basic Examples -- Indirect Solution Representations -- Properties of Neighborhood Functions -- Performance Guarantees -- Time Complexity -- Metaheuristics -- Asymptotic Convergence of Simulated Annealing 
653 |a Optimization 
653 |a Computer science 
653 |a Mathematics of Computing 
653 |a Computer science / Mathematics 
653 |a Artificial Intelligence 
653 |a Algorithms 
653 |a Artificial intelligence 
653 |a Discrete Mathematics 
653 |a Discrete mathematics 
653 |a Theory of Computation 
653 |a Mathematical optimization 
700 1 |a Aarts, Emile  |e [author] 
700 1 |a Korst, Jan  |e [author] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Monographs in Theoretical Computer Science. An EATCS Series 
028 5 0 |a 10.1007/978-3-540-35854-1 
856 4 0 |u https://doi.org/10.1007/978-3-540-35854-1?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 519.6 
520 |a 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