Theoretical Aspects of Local Search

2007
ISBN: 978-3-540-35853-4
Verlag: Springer Berlin Heidelberg

Buch, Englisch, 238 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 541 g

Reihe: Monographs in Theoretical Computer Science. An EATCS Series

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.

Zielgruppe

Research

Autoren/Hrsg.

Michiels, Wil

Korst, Jan

Aarts, Emile

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Wirtschaftswissenschaften Volkswirtschaftslehre Volkswirtschaftslehre Allgemein Ökonometrie
• Mathematik | Informatik Mathematik Operations Research Spieltheorie
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
• Wirtschaftswissenschaften Betriebswirtschaft Wirtschaftsmathematik und -statistik
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik Mathematik Operations Research Graphentheorie

Inhaltsverzeichnis

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