TY  - BOOK
AU  - Aarts,E.H.L.
AU  - Lenstra,J.K.
TI  - Local search in combinatorial optimization
SN  - 0691115222 (pbk. : alk. paper) 
AV  - T57.88 .L6 2003
PY  - 2003///]
CY  - Princeton, N.J.
PB  - Princeton University Press
KW  - Heuristic programming
KW  - Algorithms
KW  - Combinatorial optimization
N1  - Originally published: New York : Wiley, 1997; Includes bibliographical references (pages 457-493) and indexes; Introduction; Emile H. L. Aarts, Jan Karel Lenstra --; Computational compexity; Mihalis Yannakakis --; Local improvement on discrete structures; Craig A. Tovey --; Simulated annealing; Emile H. L. Aarts, Jan H. M. Korst, Peter J. M. van Laarhoven --; Tabu search; Alain Hertz, Eric Taillard, Dominique de Werra --; Genetic algorithms; Heinz Mühlenbein --; Artificial neural networks; Carsten Peterson, Bo Söderberg --; The traveling salesman problem: a case study; David S. Johnson, Lyle A. McGeoch --; Vehicle routing: modern heuristics; Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin --; Vehicle routing: handling edge exchanges; Gerard A. P. Kindervater, Martin W. P. Savelsbergh --; Machine Scheduling; Edward J. Anderson, Celia A. Glass, Chris N. Potts --; VLSI layout synthesis; Emile H. L. Aarts, Peter J. M. van Laavhoven, C. L. Liu, Peichen Pan --; Code design; Iiro S. Honkala, Patric R. J. Östergard
ER  -