Local search in combinatorial optimization
Author(s)
Bibliographic Information
Local search in combinatorial optimization
(Wiley-Interscience series in discrete mathematics and optimization)
Wiley, 1998
Reprinted with corrections
- : hard
Available at 5 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"A Wiley-Interscience publication." -- t.p.
Includes bibliographical references (p. 457-493) and indexes
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"