Overview of planning activities
Dynamic programming method is used to solve optimization problems with recursive nature, ie finding the optimal method for problems that can lead to find the optimal scheme of a finite number of subproblem. For many recursive algorithms, the principle of divide and rule (spill and Conquer) often play a key role in the design of algorithms. To […]
Recent Comments