Local search in combinatorial optimization
Author(s)
Bibliographic Information
Local search in combinatorial optimization
（Wiley-Interscience series in discrete mathematics and optimization）
Wiley, c1997
- : hard
Available at / 43 libraries
-
No Libraries matched.
- Remove all filters.
Note
"A Wiley-Interscience publication"
Includes bibliographical references and index
Description and Table of Contents
Description
In recent years, major methodological progress has been made in the design and analysis of local search algorithms in combinatorial optimization. This reference work collects the research results, consolidates the insight of major researchers and thus stimulates further progress.
Table of Contents
- Simulated Annealing and Threshold Algorithms
- Applications in Machine Scheduling
- Applications in Code Design
- Tabu Search
- A Case Study for the Travelling Salesman Problem
- Application in Vehicle Routing
- Applications in Circuit Design
- Genetic Algorithms
- Neural Networks
- Local Search on Graphs
- Computational Complexity.
by "Nielsen BookData"