Local search in combinatorial optimization / 
edited and with a new preface by Emile Aarts and Jan Karel Lenstra 
 - xii, 512 pages :  illustrations ;  24 cm 
<br/><br/> Originally published: New York : Wiley, 1997 
<br/><br/>
<br/><br/> Introduction /  Computational compexity /  Local improvement on discrete structures /  Simulated annealing /  Tabu search /  Genetic algorithms /  Artificial neural networks /  The traveling salesman problem: a case study /  Vehicle routing: modern heuristics /  Vehicle routing: handling edge exchanges /  Machine Scheduling /  VLSI layout synthesis /  Code design /  Emile H. L. Aarts, Jan Karel Lenstra --  Mihalis Yannakakis --  Craig A. Tovey --  Emile H. L. Aarts, 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 --  Emile H. L. Aarts, Peter J. M. van Laavhoven, C. L. Liu, Peichen Pan --  Iiro S. Honkala, Patric R. J. Östergard. 
<br/><br/><label>ISBN: </label>0691115222 (pbk. : alk. paper)  9780691115221 (pbk. : alk. paper)  
<br/><br/><label>LCCN: </label>2003041863 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Heuristic programming<br/>Algorithms<br/>Combinatorial optimization
<br/><br/><label>LC Class. No.: </label>T57.88  / .L6 2003