You might also like

More about Dynamic Programming Multi-Objective Combinatorial Optimization

• Book details
• Synopsis
• Trending among others

You get 398 loyalty points

Book synopsis

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.

Book details

Book category Books in English Computing & information technology Computer science Artificial intelligence

• Full title: Dynamic Programming Multi-Objective Combinatorial Optimization
• Author: Michal Mankowski, Mikhail Moshkov
• Language: English
• Binding: Paperback
• Number of pages: 214
• EAN: 9783030639228
• ID: 38603620
• Publisher: Springer Nature Switzerland AG
• Weight: 355 g
• Dimensions: 235 × 155 × 13 mm
• Date of publishing: 10. February 2022

Trending among others

---

---

---