Local Search in Combinatorial Optimization / / ed. by Jan Karel Lenstra, Emile Aarts.

• Superior document: Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
• MitwirkendeR: Aarts, Emile H . L.,; Aarts, Emile H. L.,; Anderson, Edward J.,; Gendreau, Michel,; Glass, Celia A.,; Hertz, Alain,; Honkala, Iiro S.,; Johnson, David S.,; Kindervater, Gerard A. P.,; Korst, Jan H. M.,; Laporte, Gilbert,; Lenstra, Jan Karel,; Liu, C. L.,; McGeoch, Lyle A.,; Mühlenbein, Heinz,; Pan, Peichen,; Peterson, Carsten,; Potts, Chris N.,; Potvin, Jean-Yves,; Savelsbergh, Martin W. P.,; Soderberg, Bö,; Taillard, Eric,; Tovey, Craig A.,; Yannakakis, Mihalis,; de Werra, Dominique,; van Laarhoven, Peter J. M.,; Östergård, Patric R. J.,
• HerausgeberIn: Aarts, Emile,; Lenstra, Jan Karel,
• Place / Publishing House: Princeton, NJ : : Princeton University Press, , [2018]; ©2003
• Year of Publication: 2018
• Language: English
• Physical Description: 1 online resource

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

Table of Contents

• Frontmatter
• Table of contents
• Preface to the paperback edition
• Preface
• Contributors
• 1. Introduction
• 2. Computational complexity
• 3. Local improvement on discrete structures
• 4. Simulated annealing
• 5. Tabu search
• 6. Genetic algorithms
• 7. Artificial neural networks
• 8. The traveling salesman problem: a case study
• 9. Vehicle routing: modern heuristics
• 10. Vehicle routing: handling edge exchanges
• 11. Machine scheduling
• 12. VLSI layout synthesis
• 13. Code design
• Bibliography
• Author index
• Subject index