Annotated bibliographies in combinatorial optimization
著者
書誌事項
Annotated bibliographies in combinatorial optimization
（Wiley-Interscience series in discrete mathematics and optimization）
Wiley, c1997
大学図書館所蔵 件 / 全20件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"A Wiley-Interscience publication"
Includes index
内容説明・目次
内容説明
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.
目次
- 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.
「Nielsen BookData」 より
