搜索资源列表
non0_1-Knapsack-and-full-sorting
- 这是全排序算法和非零一背包问题的简单实现,程序可以正确运行。-This is the simple realization of the whole sorting algorithm and the non0_1 kanpsack problem, the program correctly.
0-1bag
- 0—1背包问题,实现了经典背包问题.只是一个非常值得参考的算法。该算法简洁易懂,代码重用性强!-kanpsack problem which is a good algorithm for 0-1 kanosack problem!
optimization using MOEAD
- optimization using moead. for continuos and knapsack combinatorial optimization