Further processing options

Local Search in Combinatorial Optimization

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 hi...

Full Description

Bibliographic Details
Authors and Corporations: Aarts, Emile (Other), Lenstra, Jan Karel (Other)
Other Authors: Aarts, Emile , Lenstra, Jan Karel
Type of Resource: E-Book
Language: English
published:
Princeton, NJ Princeton University Press 2018
©2003
Subjects:
Source: Verbunddaten SWB
Notes: In English
ISBN: 9780691187563
0691187568
Table of Contents:
  • Frontmatter -- \ Aarts, Emile H. L. / Lenstra, Jan Karel --
  • 2. Computational complexity \ Yannakakis, Mihalis --
  • 3. Local improvement on discrete structures \ Tovey, Craig A. --
  • 4. Simulated annealing \ Aarts, Emile H . L. / Korst, Jan H. M. / van Laarhoven, Peter J. M. --
  • 5. Tabu search \ Hertz, Alain / Taillard, Eric / de Werra, Dominique --
  • 6. Genetic algorithms \ Mühlenbein, Heinz --
  • 7. Artificial neural networks \ Peterson, Carsten / Soderberg, Bö --
  • 8. The traveling salesman problem: a case study \ Johnson, David S. / McGeoch, Lyle A. --
  • 9. Vehicle routing: modern heuristics \ Gendreau, Michel / Laporte, Gilbert / Potvin, Jean-Yves --
  • 10. Vehicle routing: handling edge exchanges \ Kindervater, Gerard A. P. / Savelsbergh, Martin W. P. --
  • 11. Machine scheduling \ Anderson, Edward J. / Glass, Celia A. / Potts, Chris N. --
  • 12. VLSI layout synthesis \ Aarts, Emile H. L. / van Laarhoven, Peter J. M. / Liu, C. L. / Pan, Peichen --
  • 13. Code design \ Honkala, Iiro S. / Östergård, Patric R. J. --
  • Bibliography --