Description: Algorithm is difficult, recursive easy recursive algorithm begin with the source, the same treatment from the cycle recursive processing points, and, of divide and rule is preferred. DP Quan, greed Jane, the optimal nature of the two chief DP need to fill in the table, sub-problem solution in the table, see greedy strategy will need to prove that the whole can be built locally. Back deep, sub-limit of a wide pruning function on both sides of busy the left side of the cut is not feasible, cut the right side of the non-optimal. Sub-limit needed priority, the upper bound lower bound to sort leaves placed in the queue, the turn when it attain this purpose.
To Search:
File list (Check if you may need any files):
作业一.ppt
作业二.ppt
总结.ppt
流水作业调度.ppt
第三部分 动态规划.ppt
第二部分 递归与分治策略.ppt
第五部分 回溯法.ppt
第四部分 贪心算法.ppt
Download