Table of contents for Local search in combinatorial optimization / edited by Emile Aarts and Jan Karel Lenstra.


Bibliographic record and links to related information available from the Library of Congress catalog


Information from electronic data provided by the publisher. May be incomplete or contain other coding.


Counter
Computational Complexity (M. Yannakakis).
Local Improvement on Discrete Structures (C. Tovey).
Simulated Annealing (E. Aarts, et al.).
Tabu Search (A. Hertz, et al.).
Genetic Algorithms (H. M?hlenbein).
Artificial Neural Networks (C. Peterson & B. S?derberg).
The Travelling Salesman Problem: A Case Study (D. Johnson & L. McGeoch).
Vehicle Routing: Modern Heuristics (M. Gendreau, et al.).
Vehicle Routing: Handling Edge Exchanges (G. Kindervater & M. Savelsbergh).
Machine Scheduling (E. Anderson, et al.).
VLSI Layout Synthesis (E. Aarts, et al.).
Code Design (I. Honkala & P. ?sterg?rd).
Bibliography.
Indexes.


Library of Congress subject headings for this publication: Heuristic programming, Algorithms, Combinatorial optimization