搜索资源列表
knapsack
- knapsack，用动态规划解背包问题，可直接在eclipse上运行。-knapsack, knapsack problem using dynamic programming solution can be directly run in eclipse.
newBag
- 动态规划策略实现0-1背包问题的JAVA源程序-Dynamic planning strategy for the achievement of 0-1 Knapsack Problem JAVA source code
TestKnapsack
- 经典的背包问题用动态规划实现的JAVA代码-Classical knapsack problem using dynamic programming to achieve the JAVA code
Knapsack
- java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
Arithmetic
- 用JAVA完成的0-1背包算法，一共用了四种算法，包括贪心，分治，动态规划，回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
beibao
- 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
Backpack_01
- 动态规划法实现0-1背包，分析存储矩阵中的填充部分。-The dynamic programming method to achieve the 0-1 knapsack padding in the memory matrix.
Dynamic-Programming-0-1-knapsack
- 对于给定n种物品和一背包。在容量最大值固定的情况下，要求装入的物品价值最大化。-For a given n kinds of items, and a backpack. The maximum fixed capacity required to maximize the value of goods loaded.
Knapsack2
- 用java实现的01背包问题的动态规划算法，注释很详细，配合《算法导论》的伪代码可以很容易看懂。-01 knapsack problem with java achieve dynamic programming algorithm, very detailed notes, with the " Introduction to Algorithms" pseudo-code can easily understand.
beibao
- 文件里面的代码主要是用递归算法，动态规划的算法，贪婪算法，回溯算法解决没有利润分配的背包问题。-File inside the code is mainly used recursive algorithm, dynamic programming algorithms, greedy algorithms, backtracking algorithm to solve knapsack problem is no distribution of profits.
DP-0-1
- 0-1背包动态规划,用动态规划来求解0-1背包的问题，Java程序来实现-0-1 backpack dynamic programming, dynamic programming to solve the 0-1 knapsack problem, Java program to achieve
DynamicProgramming
- 0/1背包问题是学习动态规划算法最经典的例子 Java代码实现0/1背包问题 代码里有详细的注释，比较好理解-knapsack problem is one of the most classic problems to learn dynamic programming technique Java code,easiser to understand
12.8 01背包练习题
- java 动态规划之0-1背包问题代码详解，详细注释(0-1 knapsack problem dynamic programming code Xiangjie)