搜索资源列表
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
beibao
- 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
Knapsack
- 包含3个文件，背包问题，旅行商问题，最优BST，都是java编写的。-File have three parts .They are bag problem,knapsack problem and OptimalBST.
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
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
Knapsack
- 0-1背包问题 此算法包含了输入界面，可以随意设置货物的数量和价值。-0-1 knapsack problem algorithm includes the input interface, the number and value of the goods can be arbitrarily set.
solution-of-knapsack-problem
- 回溯法、分支限界法的原理，并能够按其原理编程实现解决0-1背包问题，以加深对回溯法、分支限界法的理解。 -Backtracking, branch and bound method principle, and can according to the principle of programming to realize solving knapsack problem, in order to deepen our understanding of the backtracking, bra
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
Knapsack
- 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorith
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.
Demo1
- 算法O-1背包问题，使用Myeclipse编写，java代码，得出最优解。-The 0-1 Knapsack
yibanbeibao
- 用JAVA实现一般背包问题（附院码）比较实用-Knapsack problem
GenericAlgorithm
- 该代码为遗传算法以及两个实例，背包问题和旅行商问题，每个实例均有三组数据写在代码中，运行时将不需要的数据注释掉即可。-The source is about generic algorithm, including two examples, the knapsack problem and the traveling salesman problem.
huisujiexian
- 用回溯界限的方法，解决背包问题。可以有效的运行.-Boundaries with backtracking method to solve the knapsack problem. Can effectively run.
Knapsack
- 使用Java编程，采用回溯算法来解决0-1背包问题。-Using the Java programming using backtracking algorithm to solve 0-1 knapsack problem.
01beibao
- 0-1背包问题，空间点对问题，图形压缩，线性时间选择以及最优二叉树的java脚本程序-0-1 knapsack problem, the point of the problem space, image compression, linear time optimal tree selection and java scr ipt program
src
- FractionalBackPack 部分背包问题的贪心求解源程序-FractionalBackPack Greedy Algorithms