搜索资源列表
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
recursiveDPKnapsack
- 用vc++6编写的程序，采用动态规划递归算法，解决背包问题。-Vc++6 with the preparation of the procedures, the use of dynamic programming recursive algorithm to solve knapsack problem.
CPP01beibao
- 使用动态规划法求解01背包问题，语言背景是c++语言-01 method using dynamic programming knapsack problem, language background is c++ language
algorithm-of-heuristic-
- 本资料详细介绍了有关启发式算法的重要内容，包括模拟退火方法，遗传算法，动态规划，背包问题，对相关的研究有帮助。-This information details the important heuristic, including simulated annealing, genetic algorithms, dynamic programming, knapsack problem, the related research help.
bag-matlab
- 背包问题动态规划matlab实现.txt 背包问题动态规划matlab实现.txt -Knapsack problem dynamic programming matlab realize. Txt knapsack problem dynamic programming matlab realize. Txt knapsack problem dynamic programming matlab realize. Txt