Local search in combinatorial optimization

書誌事項

Local search in combinatorial optimization

edited by Emile Aarts, Jan Karel Lenstra

(Wiley-Interscience series in discrete mathematics and optimization)

Wiley, c1997

  • : hard

大学図書館所蔵 件 / 43

この図書・雑誌をさがす

注記

"A Wiley-Interscience publication"

Includes bibliographical references and index

内容説明・目次

内容説明

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」 より

関連文献: 1件中  1-1を表示

詳細情報

ページトップへ