Dynamic programming multi-objective combinatorial optimization / Michal Mankowski, Mikhail Moshkov.

Unlimited

Authorized users

Can lend chapters, not whole ebooks

Dynamic programming multi-objective combinatorial optimization / Michal Mankowski, Mikhail Moshkov.

9783030639204 (electronic bk.)
3030639207 (electronic bk.)
3030639193
9783030639198

Cham : Springer, [2021]

English

1 online resource (213 pages).

10.1007/978-3-030-63920-4 doi

QA402.5

519.6/4

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.

Includes bibliographical references and index.

Access limited to authorized users.

text file
PDF

Description based on print version record.

Studies in systems, decision and control ; v. 331.

Online Resources > Ebooks
All Resources