Doesn't suit? No problem! You can return within 30 days
You won't go wrong with a gift voucher. The gift recipient can choose anything from our offer.
30-day return policy
Dynamic programming is an efficient technique for solving optimization problems. and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths.