搜索资源列表
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.
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
Garage
- 由Java Swing提供GUI的车库程序(01背包问题的实例化)-Provided by the Java Swing GUI garage program (instantiated 01 knapsack problem)
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.
Backpack
- 假设有一个能装入总体体积为T的背包和n件体积分别为w1,w2,…,wn的物品,能否从n件物品中挑若干件恰好装满背包,即使w1+w2+…+wn=T,要求找出所有满足上述条件的解。-Suppose there is a fit into the overall volume of T knapsack and N volume were W1, w2,... , WN items, whether the n items in the pick some parts just loaded bac
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
01backtrack
- JAVA实现的回溯算法,用来求解0-1背包问题,代码里面有注释,逻辑清晰-JAVA implementation of the backtracking algorithm used to solve the 0-1 knapsack problem, the code inside the notes, the logic clear
KnapsackProblem
- 算法书中的“01背包问题”的实现,由Java编写-" 01 knapsack problem" algorithm of the book, written by Java
01back
- 01背包问题算法源码,方便大家学习不同算法-01 knapsack problem algorithm source code, to facilitate them to learn different algorithms
01backagesubset
- 01背包问题,子集树解决01背包问题。希望对你有帮助Java源码-01 knapsack problem, a subset of the 01 tree knapsack problem solving. Hope you have to help Java source code
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
OwnTest
- 通过Java编码实现标准遗传算法(SGA)解决背包问题(Through Java coding, the standard genetic algorithm (SGA) is implemented to solve knapsack problem)
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)