Local Search in Combinatorial Optimization

This book provides an introduction to local search heuristics for solving combinatorial optimization problems. It covers a wide range of topics, including: * The basics of local search * Neighborhood structures and move operators * Tabu search and simulated annealing * Evolutionary algorithms * Applications to real-world problems. The book is written in a clear and concise style, and it includes numerous examples and exercises. It is an excellent resource for researchers and practitioners in the field of combinatorial optimization. This book was edited by Emile Aarts and Jan Karel Lenstra, and it was published in 1997 in the Wiley-Interscience Series in Discrete Mathematics and Optimization.