Local Search in Combinatorial Optimization
1st Edition
Published on 19. November 2018
528 pages
978-0-691-18756-3 (ISBN)
Description
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.
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.
More details
Other editions
Additional editions
Emile Aarts | Jan Karel Lenstra
Local Search in Combinatorial Optimization
Book
08/2003
Princeton University Press
€77.00
Shipment within 10-20 days
Persons
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.
Content
- Cover
- Title Page
- Copyright Page
- Table of Contents
- Preface to the paperback edition
- Preface
- Contributors
- 1. Introduction Emile H. L. Aarts, Jan Karel Lenstra
- 2. Computational complexity Mihalis Yannakak
- 3. Local improvement on discrete structures Craig A. Tovey
- 4. Simulated annealing Emile H. L. Aarts, Jan H. M. Korst, Peter J. M. van Laarhoven
- 5. Tabu search Alain Hertz, Eric Taillard, Dominique de Werra
- 6. Genetic algorithms Heinz Mühlenbein
- 7. Artificial neural networks Carsten Peterson, Bo Söderberg
- 8. The traveling salesman problem: a case study David S. Johnson, Lyle A. McGeoch
- 9. Vehicle routing: modern heuristics Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin
- 10. Vehicle routing: handling edge exchanges Gerard A. P. Kindervater, Martin W. P. Savelsbergh
- 11. Machine scheduling Edward J. Anderson, Celia A. Glass, Chris N. Potts
- 12. VLSI layout synthesis Emile H. L. Aarts, Peter J. M. van Laarhoven, C. L. Liu, Peichen Pan
- 13. Code design Iiro S. Honkala, Patric R. J. Östergård
- Bibliography
- Author index
- Subject index
