Dynamic Programming Multi-Objective Combinatorial Optimization
Mankowski, Michal
Dynamic Programming Multi-Objective Combinatorial Optimization by Michal Mankowski, Mikhail Moshkov. - First edition 2021 - 1 recurso en línea (XIV, 214 páginas) 67 illus - Studies in Systems Decision and Control 331 2198-4182 Intelligent Technologies and Robotics (SpringerNature-42732) Intelligent Technologies and Robotics (R0) (SpringerNature-43728) .
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.
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.
9783030639204
10.1007/978-3-030-63920-4 doi
Optimización combinatoria
Programación de ordenadores
Inteligencia artificial
QA402.5 / 2021 EB
Dynamic Programming Multi-Objective Combinatorial Optimization by Michal Mankowski, Mikhail Moshkov. - First edition 2021 - 1 recurso en línea (XIV, 214 páginas) 67 illus - Studies in Systems Decision and Control 331 2198-4182 Intelligent Technologies and Robotics (SpringerNature-42732) Intelligent Technologies and Robotics (R0) (SpringerNature-43728) .
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.
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.
9783030639204
10.1007/978-3-030-63920-4 doi
Optimización combinatoria
Programación de ordenadores
Inteligencia artificial
QA402.5 / 2021 EB