Michal Mankowski & Mikhail Moshkov 
Dynamic Programming Multi-Objective Combinatorial Optimization [PDF ebook] 

Support


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.

€160.49
Zahlungsmethoden

Inhaltsverzeichnis

Introduction.- Circuits Without Repetitions. Main Tools.- Combinatorial Optimization Problems. Conventional Circuits.- Multi-Stage and Bi-Criteria Optimization of Matchings in Trees.- Combinatorial Optimization Problems. Syntactical Circuits.- Index.

Dieses Ebook kaufen – und ein weitere GRATIS erhalten!
Sprache Englisch ● Format PDF ● Seiten 214 ● ISBN 9783030639204 ● Dateigröße 6.1 MB ● Verlag Springer International Publishing ● Ort Cham ● Land CH ● Erscheinungsjahr 2021 ● herunterladbar 24 Monate ● Währung EUR ● ID 7754096 ● Kopierschutz Soziales DRM

Ebooks vom selben Autor / Herausgeber

5.485 Ebooks in dieser Kategorie