{"product_id":"dynamic-programming-multi-objective-combinatorial-optimization-9783030639204","title":"Dynamic Programming Multi-Objective Combinatorial Optimization","description":"\u003cp\u003eThis 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.\u003c\/p\u003e","brand":"Gardners","offers":[{"title":"Default Title","offer_id":52929396146455,"sku":null,"price":18829.37,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0679\/6918\/8119\/files\/9783030639204.jpg?v=1781603501","url":"https:\/\/payment.letskitaboo.com\/te\/products\/dynamic-programming-multi-objective-combinatorial-optimization-9783030639204","provider":"Kitaboo One eStore","version":"1.0","type":"link"}