Dynamic Programming Multi-Objective Combinatorial Optimization

Anglický jazyk

Dynamic Programming Multi-Objective Combinatorial Optimization

Vydavateľstvo: Springer International Publishing
Rok vydania: 2021
Formát: Hardback
Rozmer: 241 x 160 mm
Jazyk: Anglický jazyk
ISBN: 9783030639198

Na objednávku, dodanie 2-4 týždne

167.19 €

bežná cena: 175.99 €

O knihe

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.