Linear network optimization : algorithms and codes
著者
書誌事項
Linear network optimization : algorithms and codes
MIT Press, c1991
- : pbk
大学図書館所蔵 件 / 全36件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
- 巻冊次
-
ISBN 9780262023344
内容説明
Large-scale optimization is becoming increasingly important for students and professionals in electrical and industrial engineering, computer science, management science and operations research, and applied mathematics. "Linear Network Optimization" presents a treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems. It explains important algorithms such as auction and relaxation, proposed by the author and others for the solution of these problems. Its coverage of both theory and implementations make it suitable as a text for a graduate-level course on network optimization as well as a practical guide to state-of-the-art codes in the field. Bertsekas focuses on the algorithms that have proved successful in practice and provides FORTRAN codes that implement them. Illustrations, examples and exercises are included in the text.
目次
- Simplex methods
- dual ascent methods
- auction algorithms
- performance and comparisons. Appendixes.
- 巻冊次
-
: pbk ISBN 9780262514439
内容説明
Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems.
Large-scale optimization is becoming increasingly important for students and professionals in electrical and industrial engineering, computer science, management science and operations research, and applied mathematics. Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems. It is the first text to clearly explain important recent algorithms such as auction and relaxation, proposed by the author and others for the solution of these problems. Its coverage of both theory and implementations make it particularly useful as a text for a graduate-level course on network optimization as well as a practical guide to state-of-the-art codes in the field. Bertsekas focuses on the algorithms that have proved successful in practice and provides FORTRAN codes that implement them. The presentation is clear, mathematically rigorous, and economical. Many illustrations, examples, and exercises are included in the text.
Contents
Introduction * Simplex Methods * Dual Ascent Methods * Auction Algorithms * Performance and Comparisons * Appendixes
「Nielsen BookData」 より