Annotated bibliographies in combinatorial optimization
Author(s)
Bibliographic Information
Annotated bibliographies in combinatorial optimization
(Wiley-Interscience series in discrete mathematics and optimization)
Wiley, c1997
Available at 20 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
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C||Annotated-197059236
Note
"A Wiley-Interscience publication"
Includes index
Description and Table of Contents
Description
Combinatorial optimization - finding the best solution(s) for problems involving many possible combinations or permutations of outcomes- uses techniques and methods drawn from areas of discrete mathematics, graph theory, probability theory, statistics and computer science. Research into problems involving combinatorial optimization has increased greatly over recent years and it is difficult for researchers to maintain an overview of the published literature. The predecessor to this book, "Combinatorial Optimization : Annotated Bibliographies" (1985), became a standard reference for researchers in the subject, but is now out of date. This new book occupies the middle ground between a pure bibliography and a collection of surveys. It is edited to maintain a unified style throughout. Each section also discusses relevant software packages.
Table of Contents
- Part I: General methodologies
- complexity and approximability
- polyhedral combinatorics
- branch-and-cut algorithms
- matroids and submodular functions
- advances in linear programming
- decomposition and column generation
- stochastic integer programming
- randomized algorithms
- local search
- graphs and matrices. Part II: Specific topics and applications
- sequencing and scheduling
- "Travelling Salesman Problem"
- max cut
- location problems
- network design
- flows and paths
- quadratic and 3-dimensional assignments
- linear assignment
- vehicle routing
- cutting and packing
- combinatorial topics in VLSI design
- applications in computational biology.
by "Nielsen BookData"