搜索资源列表
beibaotanxinsuanfa
- 贪心算法,使用这一算法,解决0-1背包问题.-greedy algorithm, the algorithm used to solve 0-1 knapsack problem.
javaTANXINFABEIBAO
- 用JAVA编写的关于算法分析与设计里的如何用JAVA实现关于贪心法的背包问题,简单明了.有很强的实例意义.-with JAVA prepared by the analysis of the algorithm and the designing of how to use JAVA of greedy law backpack , simple and clear. a strong example of significance.
Knapsack21
- 背包问题(java)一个用JAVA 实现的背包问题,P,W,M自己输入-knapsack problem (java) JAVA with a backpack, P, W, M own input
basicAlgorithm(pascal)
- 基本算法正稿 包括:一、数论算法;二、图论算法;三、背包问题;四、排序算法;五、高精度计算;六、 树的遍历;七 进制转换;八 全排列与组合的生成;九.查找算法;十、贪心;十一、回溯法框架;十二、DFS框架;十三、BFS框架;十五、数据结构相关算法
Back_Track
- 使用回溯法解决背包问题,人工智能课程实验课题。
beibaowentia
- 该源码转自于其它网站, 背包问题-switched from the source to other sites, Knapsack Problem
0-1背包
- 0-1背包问题算法在java语言的实现程序-0-1 knapsack problem algorithm java language in the realization process
package
- 此小程序用java实现了可以分割的背包问题,开发平台是Eclipse。其中主要是用贪心算法实现背包问题,在将物品进行排序时,没有使用经典的merge-sort算法,而是直接使用了java中Arrays类的sort的方法,但要自己定义类,实现接口Comparator。
BagZeroOne
- java语言实现动态规划求解0-1背包问题。
实验报告-背包
- 关于背包问题的基本思想运行结果测试平台源码-knapsack problem on the basic idea of running results Source Testing Platform
knapsack
- knapsack,用动态规划解背包问题,可直接在eclipse上运行。-knapsack, knapsack problem using dynamic programming solution can be directly run in eclipse.
rrrrrrrrr
- 0-1背包问题多种解法,你也可以学习我们的-0-1 knapsack problem a variety of solution, you can also learn from our
Knapsack
- 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
beibaobeibao
- 这是一个0/1背包问题的解决,有图形界面,是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
pacel
- 经典问题----背包问题的java源代码,求解-Knapsack problem---- the classic problem of the java source code, to solve
Beibao-JAVA
- 提供一个用Java实现背包问题的解法,如果有必要可以自行修改相关参数后再做仿真-Used to provide a Java implementation of the solution of knapsack problem and, if necessary modify the relevant parameters can then make simulation
java
- 老师给的用Java编写的算法,包括背包问题, 回溯法等等,适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning.
12.8 01背包练习题
- java 动态规划之0-1背包问题代码详解,详细注释(0-1 knapsack problem dynamic programming code Xiangjie)
回溯法(01背包问题)
- 回溯法解决01背包问题,111111111111111111(Backtracking method for solving 01 knapsack problems)
MyDPUtils
- 各类背包问题算法的java实现,并且带有部分注释(Knapsack problem algorithm java implementation, and with some notes)