Dynamic Programming Multi-Objective Combinatorial Optimization

Mankowski, Michal (Author)/ Moshkov, Mikhail (Author)

ISBN 10: 3030639193 / ISBN 13: 9783030639198

Published by Springer, 2021

About this Item

228 pages. 9.25x6.10x0.67 inches. In Stock.

Seller Inventory # x-3030639193

Bibliographic Details

• Title: Dynamic Programming Multi-Objective Combinatorial Optimization
• Publisher: Springer
• Publication Date: 2021
• Language: English
• ISBN 10: 3030639193
• ISBN 13: 9783030639198
• Binding: Hardcover
• Condition: Brand New

About this title

Synopsis

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.