Overview
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.
The book, Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control #331) [Bulk, Wholesale, Quantity] ISBN#9783030639228 in Paperback by Michal Mankowski, Mikhail Moshkov may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details
Format:
Paperback
Publication Date:
02/10/2022
ISBN-13:
9783030639228
Pages:
214
Publisher:
Springer International Publishing
