Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

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.