株式会社極東書店トップ ＞ 商品一覧 ＞ Dynamic Programming Multi-Objective Combinatorial Optimization. 2021 ed.
商品詳細
Dynamic Programming Multi-Objective Combinatorial Optimization. 2021 ed.
・ISBN 978-3-030-63919-8 hard EUR 159.99
￥42,764.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Mankowski, Michal / Moshkov, Mikhail, |
|---|---|
| シリーズ | (Studies in Systems, Decision and Control) |
| 出版社 | (Springer Nature Switzerland AG, SZ) |
| 出版年月 | 2021 |
| ページ数 | 214 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A03-92488＞ |
解説
This book introduces a fairly universal approach to the design and analysis of exact optimization algorithms for multi-objective combinatorial optimization problems. It proposes the circuits without repetitions representing the sets of feasible solutions along with the increasing and strictly increasing cost functions as a model for such problems. The book designs the algorithms for multi-stage and bi-criteria optimization and for counting the solutions in the framework of this model.
As applications, this book studies eleven known combinatorial optimization problems: matrix chain multiplication, global sequence alignment, optimal paths in directed graphs, binary search trees, convex polygon triangulation, line breaking (text justification), one-dimensional clustering, optimal bitonic tour, segmented least squares, optimization of matchings in trees, and 0/1 knapsack problem.
The results presented are useful for researchers in combinatorial optimization. This book is also useful as the basis for graduate courses.
As applications, this book studies eleven known combinatorial optimization problems: matrix chain multiplication, global sequence alignment, optimal paths in directed graphs, binary search trees, convex polygon triangulation, line breaking (text justification), one-dimensional clustering, optimal bitonic tour, segmented least squares, optimization of matchings in trees, and 0/1 knapsack problem.
The results presented are useful for researchers in combinatorial optimization. This book is also useful as the basis for graduate courses.