Theoretical Aspects of Local Search

Theoretical Aspects of Local Search
-0 %
 HC runder Rücken kaschiert
Print on Demand | Lieferzeit: Print on Demand - Lieferbar innerhalb von 3-5 Werktagen I

Unser bisheriger Preis:ORGPRICE: 106,99 €

Jetzt 106,98 €* HC runder Rücken kaschiert

Alle Preise inkl. MwSt. | Versandkostenfrei
Artikel-Nr:
9783540358534
Veröffentl:
2006
Einband:
HC runder Rücken kaschiert
Erscheinungsdatum:
28.11.2006
Seiten:
248
Autor:
Wil Michiels
Gewicht:
541 g
Format:
241x160x19 mm
Serie:
Monographs in Theoretical Computer Science. An EATCS Series
Sprache:
Englisch
Beschreibung:

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.

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.
Basic Examples.- Indirect Solution Representations.- Properties of Neighborhood Functions.- Performance Guarantees.- Time Complexity.- Metaheuristics.- Asymptotic Convergence of Simulated Annealing.

Kunden Rezensionen

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.