PKK Library

Your cart is empty.

Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Theoretical Aspects of Local Search

By: Michiels, Wil [author.].
Contributor(s): Korst, Jan [author.] | Aarts, Emile [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Monographs in Theoretical Computer Science, An EATCS Series: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.Description: VIII, 238 p. 70 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540358541.Subject(s): Mathematics | Computers | Algorithms | Computer science -- Mathematics | Artificial intelligence | Mathematical optimization | Discrete mathematics | Mathematics | Optimization | Discrete Mathematics | Mathematics of Computing | Algorithm Analysis and Problem Complexity | Theory of Computation | Artificial Intelligence (incl. Robotics)DDC classification: 519.6 Online resources: Click here to access online
Contents:
Basic Examples -- Indirect Solution Representations -- Properties of Neighborhood Functions -- Performance Guarantees -- Time Complexity -- Metaheuristics -- Asymptotic Convergence of Simulated Annealing.
In: Springer eBooksSummary: 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.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK1531
Total holds: 0

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

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.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha