搜索资源列表
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
Knapsack-problem
- 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。-Suppose a total volume of T can be packed into a backpack and n pieces of volume, respectively w1, w2, ..., wn items, items can be selected from n nu
01beibaosuanfa_java
- 01背包四种算法实现(java版)， 是大学算法可的课程设计-01 backpack four algorithms (java version), a university curriculum design algorithm
a
- 0—1背包问题描述如下： 给定m种物品和一背包。物品i的重量是w[i]，其价值为v[i]，背包的容量是c，问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。(每种物品只能选择放入0/1次背包）-0-1 knapsack problem described as follows: given m types of items and a backpack. Item i of the weight of w [i], a value of v [i], the capacity
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.
suanfa
- 大家又到准备蓝桥比赛的时候了，这是我去年备赛时的几个java算法程序，其中包括汉诺塔、两种幻方、背包和约瑟夫环，汉诺塔是去年的考试题，希望可以帮到大家。-People to prepare the blue bridge game when I prepared race last year when several java algorithm, including the Tower of Hanoi, two magic squares, backpack and Josephus, To
bag.zip
- 计算物品堆叠所占的背包格子数,通过取余取整获得。,The calculate the backpack plaid number of items stacked share, rounded to obtain by taking the remainder.
mochila_BB
- Branch and Bound program for the backpack problem
Scripts
- unity3D 角色背包 拾取 记录点 的源代码-unity3D role backpack pickup point source records
01beibao
- 01背包的完整版，采用动态规划和贪婪算法解决-01 backpack full version, using dynamic programming and greedy algorithm to solve
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
BranchAndBound-master
- Branch and bound method to solve the backpack problem
knapsack_genetic_algorithm-master
- Branch and bound method to solve the backpack problem