Local Search in Combinatorial Optimization / Edition 1

by Emile Aarts, Jan Karel Lenstra

Overview

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. 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 reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science.


In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård.

Product Details

ISBN-13:	9780691115221
Publisher:	Princeton University Press
Publication date:	08/03/2003
Series:	Mathematical Sciences Ser.
Edition description:	With a New preface by the editors
Pages:	528
Product dimensions:	6.00(w) x 9.25(h) x (d)

About the Author

Emile Aarts is Vice-President and Scientific Program Director of the Philips Research Laboratories, Eindhoven, and a Professor of Computer Science at Eindhoven University of Technology. Jan Karel Lenstra is the John P. Hunter Chair and Professor of Industrial and Systems Engineering at the Georgia Institute of Technology.

Table of Contents

Computational Complexity (M. Yannakakis).

Local Improvement on Discrete Structures (C. Tovey).

Simulated Annealing (E. Aarts, et al.).

Tabu Search (A. Hertz, et al.).

Genetic Algorithms (H. Muhlenbein).

Artificial Neural Networks (C. Peterson & B. Soderberg).

The Travelling Salesman Problem: A Case Study (D. Johnson & L. McGeoch).

Vehicle Routing: Modern Heuristics (M. Gendreau, et al.).

Vehicle Routing: Handling Edge Exchanges (G. Kindervater & M. Savelsbergh).

Machine Scheduling (E. Anderson, et al.).

VLSI Layout Synthesis (E. Aarts, et al.).

Code Design (I. Honkala & P. Ostergard).

Bibliography.

Indexes.

What People are Saying About This

From the Publisher

"[This] is the best current reference for local search methods. I would expect this volume to remain an important reference for quite a number of years."—William J. Cook, Georgia Institute of Technology

Cook

[This] is the best current reference for local search methods. I would expect this volume to remain an important reference for quite a number of years.
— William J. Cook, Georgia Institute of Technology

Editorial Reviews

"A truly remarkable and unique collection of work. . . . Invaluable."

Informs

"The world of local search has changed dramatically in the last decade and Aarts and Lenstra's book is a tribute to this development. . . . A very useful source."

Optima

"[This] is the best current reference for local search methods. I would expect this volume to remain an important reference for quite a number of years."—William J. Cook, Georgia Institute of Technology

From the Publisher