搜索资源列表
beibao
- 非递归背包 而提尔而喝酒伊特和人家一块和金额很容易空间-Tire, but non-recursive backpack and a drink Voight and others, and the amount of space is easy to
beibao
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
beibao
- 背包问题!给定几个不同的载重物体,以及利润!得出最优解。-Knapsack problem! For a given load several different objects, and profit! Reached the optimal solution.
beibao
- DD大牛的背包九讲,从01背包逐渐深入,完整的阐述了各种背包问题-backpack 9
beibao
- 给定物品n件,他们的重量分别是w[0],w[1],……w[n-1],物品的价值分别为v[0],v[1],……v[n-1],另有一个背包,它可以容纳的总重量为w。设计一种物品挑选方案,要求从这n件物品中所选取的物品的总重量不超过背包的容量w,使选中物品的价值之和最大。 -N pieces of a given item, the weight they were w [0], w [1], ... ... w [n-1], the value of goods, respectively v [0
1
- 贪心算法0-1背包问题,很全面,很有用的-beibao
knap
- 分支限界求背包问题相对于贪心法等有很大的优势-fenzhi xianjie beibao
beibao
- 这是一个关于背包问题的解法,里面包含了源代码,请仔细研究-some example
javabeibaoTsp
- 背包算法,结合tsp实现,代码为Java版本-Java programming tsp 0 1 beibao
beibao
- 背包问题的实现,利用堆栈,显示背包问题 ,背包的大小可以自己控制,物品的大小也可以自己输入。实现背包问题完全解析-beibaoprober
0-1beibao
- 用户贪心算法解决背包问题,c++源代码,喜欢大家喜欢-the question of beibao
beibao.doc.tar
- 程序算法,动态规划,背包问题。。。供学习动态规划。-Program algorithm, dynamic programming, knapsack problem. . . For learning dynamic programming.
beibao
- 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品,能否从n件物品中挑选若干件恰好装满背包,即使w1 +w2 + … + wn=T,要求找出所有满足上述条件的解。例如:当T=10,各件物品的体积{1,8,4,3,5,2}时,可找到下列4组解:(1,4,3,2) (1,4,5) (8,2) (3,5,2)。 提示:可利用回溯法的设计思想来解决背包问题。首先将物品排成一列,然后顺序选取物品装入背包,假设已选取了前i 件物品之后背包还没有装满,则继
monituihuo_beibao
- 模拟退火解决背包问题,采用c语言编写,the problem of beibao solved by mnth-the problem of beibao solved by mnth
beibao
- 背包问题的动态规划求解采用一维数组求解 结构体数组-Knapsack problem solved using dynamic programming for solving one-dimensional array of array of structures
BeiBao
- 遗传算法解决背包问题,代码功力深厚。 更个王振的东西。很好-Genetic algorithm to solve knapsack problem, the code profound skill.
beibao--wenti
- 背包问题,百度文库上下载的,代码有点长,你懂得-Knapsack problem, Baidu download library, code a bit long, you know
beibao
- 背包问题的资料,相对比较全了,可以入门学习用。-Knapsack problem of information, relatively wide, and can be started learning to use.
beibao
- 用动态规划的方法解0/1背包问题。用VC6编译运行正确。供参考-Using dynamic programming for solving 0/1 knapsack problem. Compile and run correctly with VC6. Reference
beibao
- 用贪心法解决背包问题:设有不同价值、不同重量的物品n件,求从这n件物品中选取一部分物品的方案, 使选中的物品的总重量不超过指定的限制重量,但选中物品的价值之和最大。-Knapsack problem with a greedy method to solve: with different values, different weights of items n pieces, find items from n items in the select part of the program