Local search in combinatorial optimization / 
edited by Emile Aarts and Jan Karel Lenstra. 
 - Chichester [England] ;  New York :  Wiley,  c1997. 
 - x, 512 p. :  ill. ;  25 cm. 
 - Wiley-Interscience series in discrete mathematics and optimization .
<br/><br/> "A Wiley-Interscience publication." 
<br/><br/>Includes bibliographical references (p. 457-493) and indexes. 
<br/><br/>Computional complexity / Mihalis Yannakakis -- Local improvement on discrete structures / Craig A. Tovey -- Simulated annealing / Emile H.L. Aarts ... [et al.] -- Tabu search / Alain Hertz, Eric Taillard, Dominique de Werra -- Genetic algorithms / Heinz M�uhlenbein -- Artificial neural networks / Carsten Peterson, Bo S�oderberg -- 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. Savelsberg -- Machine scheduling / Edward J. Anderson, Celia A. Glass, Chris N. Potts -- VLSI layout synthesis / Emile H.L. Aarts, Peter J.M. van Laarhoven, C.L. Liu, Peichen Pan -- Code design / Iiro S. Honkala, Patric R.J. �Osterg�ard. 
<br/><br/><label>ISBN: </label>0471948225 (alk. paper) 
<br/><br/><label>LCCN: </label>96036111 
<br/><br/><label>Nat. Bib. No.: </label>GB97-33775 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Heuristic programming.<br/>Algorithms.<br/>Combinatorial optimization.<br/>Programacao matematica<br/>Inteligencia artificial