Introduction - If you have any usage issues, please Google them yourself
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.
Packet : 91331951beibaowenti007.rar filelist
背包问题\实习三 0-1背包问题.doc
背包问题\背包问题.cpp
背包问题