Stochastic local search : foundations and applications /
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 algo...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
San Francisco, CA :
Morgan Kaufmann Publishers,
©2005.
|
| Series: | Morgan Kaufmann Series in Artificial Intelligence Ser.
|
| Subjects: | |
| Online Access: | CONNECT CONNECT |
Table of Contents:
- SLS methods
- Generalised local search machines
- Empirical analysis of SLS algorithms
- Search space structure and SLS performance
- Propositional satisfiability and constraint satisfaction
- MAX-SAT and MAX-CSP
- Travelling salesman problems
- Scheduling problems
- Other combinatorial problems.
