02207cam a2200409 a 4500 ocm35249568 0 20230123133519.0 960808s1997 enka b 001 0 eng 96036111 GB97-33775 36916856 0471948225 (alk. paper) UKM b9733775 H130 DLC NUST C#P UKM PMC UBA OCLCQ MAIN T57.88 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 "A Wiley-Interscience publication." Includes bibliographical references (p. 457-493) and indexes. 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. Heuristic programming. Algorithms. Combinatorial optimization. Programacao matematica larpcal Inteligencia artificial larpcal Aarts, E. H. L. (Emile H. L.) Lenstra, J. K. Table of contents http://www.loc.gov/catdir/toc/onix02/96036111.html .b10016442 28-11-03 17-04-03 92 ZNA BOOKS T57.88 149905 149905 2023-01-23 00:00:00 2 T57.88 LOC 92003015466 80.00 2023-01-23 BOOKS 0 LCC 0 0 NFIC 0 MAIN MAIN GEN 2023-01-23 80.00