Local Search in Combinatorial Optimization

Preface to the paperback edition vii Preface ix Contributors xi 1. Introduction 1(18) Emile H.L. Aarts, Jan Karel Lenstra 2. Computational complexity 19(38) Mihalis Yannakakis 3. Local improvement on discrete structures 57(34) Craig A. Tovey 4. Simulated annealing 91(30) Emile H.L. Aarts, Jan H.M. Korst, Peter J.M. van Laarhoven 5. Tabu search 121(16) Alain Hertz, Eric Taillard, Dominique de Werra 6. Genetic algorithms 137(36) Heinz Mühlenbein 7. Artificial neural networks 173(42) Carsten Peterson, Bo Soderberg 8. The traveling salesman problem: a case study 215(96) David S. Johnson, Lyle A. McGeoch 9. Vehicle routing: modern heuristics 311(26) Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin 10. Vehicle routing: handling edge exchanges 337(24) Gerard A.P. Kindervater, Martin W.P. Savelsbergh 11. Machine scheduling 361(54) Edward J. Anderson, Celia A. Glass, Chris N. Potts 12. VLSI layout synthesis 415(26) Emile H.L. Aarts, Peter J.M. van Laarhoven, C.L. Liu, Peichen Pan 13. Codedesign 441(16) Iiro S. Honkala, Patric R.J. Östergård Bibliography 457(38) Author index 495(12) Subject index 507