Contact
How to shop
Delivery
Shopping guide
Dynamic Programming Multi-Objective Combinatorial Optimization
English
398 b
Up to 30 days for returns
Customers also purchased
/
Paperback
35.39
€
/
Paperback
14.47
€
/
Hardback
34.69
€
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
15.38
€
/
Paperback
8.54
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?