Stochastic local search : foundations and applications
Author(s)
Bibliographic Information
Stochastic local search : foundations and applications
Morgan Kaufmann, c2005
Available at / 11 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 575-631) and index
Description and Table of Contents
Description
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.
Hoos and Stutzle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful tool.
Table of Contents
Part I. Foundations1. Introduction2. SLS Methods3. Generalized Local Search Machines4. Empirical Analysis of SLS Algorithms5. Search Space Structure and SLS Performance
Part II. Applications6. SAT and Constraint Satisfaction7. MAX-SAT and MAX-CSP8. Traveling Salesman Problems9. Scheduling Problems10. Other Combinatorial Problems
by "Nielsen BookData"
