Local search in combinatorial optimization
著者
書誌事項
Local search in combinatorial optimization
(Wiley-Interscience series in discrete mathematics and optimization)
Wiley, 1998
Reprinted with corrections
- : hard
大学図書館所蔵 件 / 全5件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"A Wiley-Interscience publication." -- t.p.
Includes bibliographical references (p. 457-493) and indexes
内容説明・目次
内容説明
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.
目次
- 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.
「Nielsen BookData」 より