{"product_id":"9783030639228","title":"Dynamic Programming Multi-Objective Combinatorial Optimization","description":"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.","brand":"Michal Mankowski","offers":[{"title":"Default Title","offer_id":47645619814718,"sku":"9783030639228","price":4912.39,"currency_code":"ZAR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4357\/7662\/products\/9783030639228.jpg?v=1707700132","url":"https:\/\/exclusivebooks.co.za\/products\/9783030639228","provider":"Exclusive Books Online","version":"1.0","type":"link"}