搜索资源列表
src
- java 0-1背包问题 动态算法实现 带图形界面-knapsack code
bag1
- 用动态规划法解决0/1背包问题，上传的是源码，经调试可以运行-use dymnamic Programming answer the knapsack problem
0_1Knasack
- 比较了求解0-1背包问题常用的几种算法，并用回溯法和分支限界法进行了Java编程实现，给出了文档及源码。-0-1 knapsack problem compared several commonly used algorithms, and use backtracking and branch and bound method of the Java programming, given the documentation and source code.
MHjava
- Merkle-Hellman knapsack cryptosystem.
MHknapsack
- Merkle-Hellman knapsack cryptosystem
DKP
- 改进的0-1背包算法 根据原算法的特点，使用序偶改进。-0-1 knapsack algorithm improved algorithm based on the characteristics of the original, even using the improved procedures.
TestKnapsack
- 0-1背包问题java算法及实现，使用java图形界面-0-1 knapsack problem java algorithm and implementation, the use of java GUI
data-struct-program
- 一元稀疏多项式计算器、迷宫问题、成绩分析问题、图的基本操作与实现以及背包问题的求解-One yuan sparse polynomial calculator, maze, performance analysis of the problem, graph realization of the basic operations and the knapsack problem and the solution
Kruskal
- 01背包問題程式碼，上課使用的!!作業一完整版-01 knapsack problem code, class to use!! Operating a full version
beibao
- 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
dietsehat
- This a php code for solving knapsack problem-This is a php code for solving knapsack problem
Knapscak
- Knapsack Problem using java applet
src
- 逻辑回归的jar包和示例程序，可以处理背包问题和其它的逻辑回归问题-Logistic regression jar package to deal with the knapsack problem
A-few-basic-algorithms
- 几个基本算法，包括背包问题、皇后问题、集装箱装载、最大值最小值-A few basic algorithms, including the knapsack problem, the Queen, container loading, the maximum value of the minimum
Backpack_01
- 动态规划法实现0-1背包，分析存储矩阵中的填充部分。-The dynamic programming method to achieve the 0-1 knapsack padding in the memory matrix.
GreedyAlgorithms
- 贪心法实现背包问题，运用枚举法实现，根据结果分析该算法的贪心性质-The greedy method knapsack problem, using the enumeration method to achieve, based on the results of analysis of the greedy nature of the algorithm
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.
Knapsack9
- This source code about Knapsack algorithm in java program. This is very usefull and easy to learn, because the source codes is simple implementation. -This is source code about Knapsack algorithm in java program. This is very usefull and easy to lear
CreatePluginsConfig
- 背包问题扩展——解公司外包成本问题 小米所在的公司需要至少W个其他公司提供的外包人员，现在有N家公司向小米的公司提供了可选方案，其中 Pi代表可提供外包人员单位数，如5人为一个单位数，若选用该公司方案，则必须采用整单位数的人数，如5人为一个单位数，则X公司只能采用n*5个人数（n=0,1,2,….)。Ci代表为Pi单位数员工提供的总工资，单位是万元 输入格式： N W Pi C i 请问，采取什么样的方案可以满足公司花最少的开销招到至少W个外包人员，求出最少的开销金额。
DAIMA
- 大学生毕业论文模拟退火算法解决背包问题的jsp源代码文件-JSP source code files of graduation thesis simulated annealing algorithm to solve knapsack problem