Kostenloser Versand
Bequem zahlen
Wir sind gerne für Sie da
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.
Produkteigenschaften
- Artikelnummer: 9783030639228
- Medium: Buch
- ISBN: 978-3-030-63922-8
- Verlag: Springer International Publishing
- Erscheinungstermin: 10.02.2022
- Sprache(n): Englisch
- Auflage: 1. Auflage 2021
- Serie: Studies in Systems, Decision and Control
- Produktform: Kartoniert
- Gewicht: 353 g
- Seiten: 214
- Format (B x H x T): 155 x 235 x 13 mm
- Ausgabetyp: Kein, Unbekannt