Dynamic Programming Multi-Objective Combinatorial Optimization

Lieferzeit: Lieferbar innerhalb 14 Tagen

171,19 

Studies in Systems, Decision and Control 331

ISBN: 3030639223
ISBN 13: 9783030639228
Autor: Mankowski, Michal/Moshkov, Mikhail
Verlag: Springer Verlag GmbH
Umfang: xiv, 214 S., 67 s/w Illustr., 214 p. 67 illus.
Erscheinungsdatum: 10.02.2022
Auflage: 1/2022
Produktform: Kartoniert
Einband: Kartoniert

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.

Artikelnummer: 4937489 Kategorie:

Beschreibung

Herstellerkennzeichnung:


Springer Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

E-Mail: juergen.hartmann@springer.com

Das könnte Ihnen auch gefallen …