This is about 01 knapsack problem dynamic programming algorithm.

这是关于01背包问题的动态规划算法.

互联网

Backtracking to master the application of retrospective method with 0 - 1 knapsack problem.

掌握回溯法的应用用回溯法求解 0-1 背包问题.

互联网

The function optimization and knapsack problem show the effectiveness of PEA.

函数优化和背包问题实验验证了PEA的 有效性.

互联网

Trial designed recursive algorithm for solving knapsack problem.

试用递归方法设计求解背包问题的算法.

互联网

According to thethe existed algorithms of 0 - 1 knapsack problem, a new non - recursive algorithm the paper.

针对目前求解0-1背包问题算法的优缺点, 开发了一种新的 非 递归算法.

互联网

Results of the numerical experiment show it is effective and useful in solving 0 - 1 knapsack problem.

仿真实验结果表明了该算法求解0-1背包问题的有效性与适用性.

互联网