{"product_id":"dynamic-programming-multi-objective-combinatorial-optimization-9783030639228","title":"Dynamic Programming Multi-Objective Combinatorial Optimization","description":"\u003cp\u003e • Author(s): Michal Mankowski\u003cbr\u003e • Publisher: Springer\u003cbr\u003e • Publisher Imprint: Springer\u003cbr\u003e • BISAC: Engineering (General)\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003cb\u003eFrom the Back Cover\u003c\/b\u003e\u003cbr\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.\u003cbr\u003eAs 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.\u003cbr\u003eThe results presented are useful for researchers in combinatorial optimization. This book is also useful as the basis for graduate courses.\u003cbr\u003e\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Paperback","offer_id":45278953930903,"sku":"9783030639228","price":11643.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9783030639228.webp?v=1769292309","url":"https:\/\/atlanticbooks.com\/products\/dynamic-programming-multi-objective-combinatorial-optimization-9783030639228","provider":"Atlantic Books","version":"1.0","type":"link"}