name_knapsack012.output

0/1/2背包问题,从文件输入,从文件输出.里面有详细的报告和程序说明文档

The optimal  value are: 21
The optimal x's value are: [2,1,0,0,1].
The f' values are:
   y0  1  2  3  4  5  6  7  8  9  10  
i
5   0  0  0  0  6  6  6  6  12  12  12  
4   0  0  0  0  6  6  6  6  12  12  12  
3   0  0  0  0  6  6  6  6  12  12  12  
2   0  0  3  3  6  6  9  9  12  12  15