Local search in combinatorial optimization
By: edited by Emile Aarts and Jan Karel Lenstra.
Contributors: Aarts, E. H. L.; Lenstra, J. K.
Series: Wiley-Interscience series in discrete mathematics and optimization
Publisher: Wiley
Published: 1997
Place of publication: Chichester [England]; New York
Language: eng
Number of pages: 512
Subjects: Heuristic programming.; Algorithms.; Combinatorial optimization.
Description: In the past three decades local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time. This area of discrete mathematics is of great practical use and is attracting ever increasing attention.

The contributions to this book cover local search and its variants from both a theoretical and practical point of view, each with a chapter written by leading authorities on that particular aspect. This book is an important reference volume and an invaluable source of inspiration for advanced students and researchers in discrete mathematics, computer science, operations research, industrial engineering and management science.
Notes: Includes bibliographical references (p. 457-493) and indexes.
"A Wiley-Interscience publication."