Description: dynamic planning backward processing method knapsack problem of optimal decision-making sequence. That is, given a sequence of backpack weight and the relative value of the benefits should be. To make an optimal decision-making sequence Xi (i = 1 ~ n), and makes the ultimate effectiveness of the largest.
To Search:
File list (Check if you may need any files):
Download