Local search has been applied successfully to a diverse collection of optimization problems. However, results are scattered throughout the literature. This is t

1. Introduction -- 2. Computational complexity -- 3. Local improvement on discrete structures -- 4. Simulated annealing -- 5. Tabu search -- 6. Genetic algorith

Heuristics are strategies using readily accessible, loosely applicable information to control problem solving. Algorithms, for example, are a type of heuristic.

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems. Offering a syste