Local Search in Combinatorial Optimization
eBook - PDF

Local Search in Combinatorial Optimization

  1. English
  2. PDF
  3. Available on iOS & Android
eBook - PDF

Local Search in Combinatorial Optimization

About this book

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.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Local Search in Combinatorial Optimization by Emile Aarts, Jan Karel Lenstra, Emile Aarts,Jan Karel Lenstra, Emile Aarts, Jan Lenstra in PDF and/or ePUB format, as well as other popular books in Mathematics & Computer Science General. We have over one million books available in our catalogue for you to explore.

Table of contents

  1. Cover
  2. Title Page
  3. Copyright Page
  4. Table of Contents
  5. Preface to the paperback edition
  6. Preface
  7. Contributors
  8. 1. Introduction Emile H. L. Aarts, Jan Karel Lenstra
  9. 2. Computational complexity Mihalis Yannakak
  10. 3. Local improvement on discrete structures Craig A. Tovey
  11. 4. Simulated annealing Emile H. L. Aarts, Jan H. M. Korst, Peter J. M. van Laarhoven
  12. 5. Tabu search Alain Hertz, Eric Taillard, Dominique de Werra
  13. 6. Genetic algorithms Heinz MĂŒhlenbein
  14. 7. Artificial neural networks Carsten Peterson, Bo Söderberg
  15. 8. The traveling salesman problem: a case study David S. Johnson, Lyle A. McGeoch
  16. 9. Vehicle routing: modern heuristics Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin
  17. 10. Vehicle routing: handling edge exchanges Gerard A. P. Kindervater, Martin W. P. Savelsbergh
  18. 11. Machine scheduling Edward J. Anderson, Celia A. Glass, Chris N. Potts
  19. 12. VLSI layout synthesis Emile H. L. Aarts, Peter J. M. van Laarhoven, C. L. Liu, Peichen Pan
  20. 13. Code design Iiro S. Honkala, Patric R. J. ÖstergĂ„rd
  21. Bibliography
  22. Author index
  23. Subject index