Mikhail Moshkov: Dynamic Programming Multi-Objective Combinatorial Optimization
Dynamic Programming Multi-Objective Combinatorial Optimization
Buch
- Springer International Publishing AG, 02/2021
- Einband: Gebunden, HC runder Rücken kaschiert
- Sprache: Englisch
- ISBN-13: 9783030639198
- Bestellnummer: 10429003
- Umfang: 228 Seiten
- Nummer der Auflage: 21001
- Auflage: 1st ed. 2021
- Gewicht: 512 g
- Maße: 241 x 160 mm
- Stärke: 18 mm
- Erscheinungstermin: 9.2.2021
- Serie: Studies in Systems, Decision and Control - Band 331
Achtung: Artikel ist nicht in deutscher Sprache!
Weitere Ausgaben von Dynamic Programming Multi-Objective Combinatorial Optimization
Klappentext
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.