Michal Mankowski & Mikhail Moshkov 
Dynamic Programming Multi-Objective Combinatorial Optimization [PDF ebook] 

支持


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.

€160.49
支付方式

表中的内容

Introduction.- Circuits Without Repetitions. Main Tools.- Combinatorial Optimization Problems. Conventional Circuits.- Multi-Stage and Bi-Criteria Optimization of Matchings in Trees.- Combinatorial Optimization Problems. Syntactical Circuits.- Index.

购买此电子书可免费获赠一本!
语言 英语 ● 格式 PDF ● 网页 214 ● ISBN 9783030639204 ● 文件大小 6.1 MB ● 出版者 Springer International Publishing ● 市 Cham ● 国家 CH ● 发布时间 2021 ● 下载 24 个月 ● 货币 EUR ● ID 7754096 ● 复制保护 社会DRM

来自同一作者的更多电子书 / 编辑

5,485 此类电子书