Noch Fragen? 0800 / 33 82 637

Dynamic Programming Multi-Objective Combinatorial Optimization

Produktform: E-Buch Text Elektronisches Buch in proprietärem

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. weiterlesen

Dieser Artikel gehört zu den folgenden Serien

Elektronisches Format: PDF

Sprache(n): Englisch

ISBN: 978-3-030-63920-4 / 978-3030639204 / 9783030639204

Verlag: Springer International Publishing

Erscheinungsdatum: 08.02.2021

Seiten: 214

Autor(en): Mikhail Moshkov, Michal Mankowski

160,49 € inkl. MwSt.
Recommended Retail Price
kostenloser Versand

lieferbar - Lieferzeit 10-15 Werktage

zurück