Description: 背包问题动态规划算法JAVA
给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？
在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem. Platform: |
Size: 1024 |
Author:杜丹 |
Hits:
Description: //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm Platform: |
Size: 1024 |
Author:ss |
Hits:
Description: 0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports. Platform: |
Size: 157696 |
Author:王若 |
Hits:
Description: 经典的背包问题用动态规划实现的JAVA代码-Classical knapsack problem using dynamic programming to achieve the JAVA code Platform: |
Size: 1024 |
Author:L |
Hits:
Description: java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas. Platform: |
Size: 1024 |
Author:liangsi |
Hits:
Description: 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem Platform: |
Size: 9216 |
Author:鱼 |
Hits:
Description: 用java实现的01背包问题的动态规划算法，注释很详细，配合《算法导论》的伪代码可以很容易看懂。-01 knapsack problem with java achieve dynamic programming algorithm, very detailed notes, with the " Introduction to Algorithms" pseudo-code can easily understand. Platform: |
Size: 1024 |
Author:xuchao |
Hits:
Description: 0/1背包问题是学习动态规划算法最经典的例子
Java代码实现0/1背包问题
代码里有详细的注释，比较好理解-knapsack problem is one of the most classic problems to learn dynamic programming technique
Java code,easiser to understand Platform: |
Size: 6144 |
Author:koolboy |
Hits:
Search - knapsack problem dynamic java