搜索资源列表
ACO_0_1_bag
- 蚁群算法解0-1背包问题 内附测试文件 解的质量一般叫好,但是背包数增加时,耗时较长-Ant Colony Algorithm for 0-1 Knapsack Problem solution document containing test the quality of the general good, but the increase in the number of backpack, the longer time-consuming
Knapsackproblem
- 它是在1978年由Merkel和Hellman提出的。它的主要思路是假定某人拥有大量物品,重量各不同。此人通过秘密地选择一部分物品并将它们放到背包中来加密消息。背包中的物品中重量是公开的,所有可能的物品也是公开的,但背包中的物品是保密的。附加一定的限制条件,给出重量,而要列出可能的物品,在计算上是不可实现的。背包问题是熟知的不可计算问题,背包体制以其加密,解密速度快而其人注目。但是,大多数一次背包体制均被破译了,因此现在很少有人使用它。 -It was in 1978, made by Me
backpack
- 0/1背包问题(附注释):不可拆分的0/1背包问题-0/1 knapsack problem (with Notes): non-split 0/1 knapsack problem
01beibaowenti
- 给定n种物品和一前包.物品i的重量是Wi,其价值是Vi,背包的容量是C. 问:应该如何选择装入背包的物品,使得背包中的物品的总价值最大? 输入: 第一行两个数,n c.n是整数且小于11,c是实数,n和c之间空格 以下是n行,每行是两个实数,分别是各个物品的重量和价值 输出:两行 背包剩余重量 所装物品价值和(均保留两位小数) 所选择物品的编号,由空格间隔-Given n kinds of goods and a pre-pack. Item i of the
beibaowenti
- 背包问题,如何装背包能使背包获得最大的价值-Knapsack problem, how to make backpack loaded backpack get the most value
pack
- 完全背包问题(用每类物品的任意数量装满背包,使背包中物品的总价值最大)-Full knapsack problem (with any number of each type of goods loaded backpack, so that the total value of items in backpack maximum)
mimaxue
- 内含背包程序,RSA程序,中国剩余定理程序和GCD程序的源代码-Includes backpack program, RSA program, Chinese remainder theorem programs and GCD program' s source code
beibao
- 非递归背包 而提尔而喝酒伊特和人家一块和金额很容易空间-Tire, but non-recursive backpack and a drink Voight and others, and the amount of space is easy to
beibaotanluanchengxu
- 利用c语言写的背包贪婪算法,程序简短精炼,希望对大家有所帮助-Using c language written backpack greedy algorithm, program short refining, want to help everyone
beibao
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
beibaowenti
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
pakcageProblem
- 01背包问题,完全背包,以及多重背包问题的详解和源程序。-01 knapsack problem, complete backpack, and multiple knapsack problem Xiangjie and procedures.
KnapsackProblem
- 问题:已知有n种物品和一个可容纳M重量的背包,每种物品i的重量为wi。假定将物品i的一部分xi放入背包就会得到pixi的效益,这里,0≤xi≤1,pi>0。如果这些 物品重量的和大于M,要求所有选中要装入背包的物品总重 量不得超过M,而装入背包物品获得的总效益最大。-Question: are known to have n kinds of goods and M can hold the weight of a backpack, the weight of each item
DONGTAI
- 编程实现背包问题的动态规划算法。 输入要求: 第一行:物体个数N 背包载重量M (N,M≥1) 第i行:第i-1个物体的重量 价值(i=2,3,…,N+1)-Programming the dynamic programming algorithm for knapsack problem. Input requirements: first line: the number of objects N backpack load of M (N, M ≥ 1) the f
KnapSack
- 动态规划法解背包问题。 结果举例 1、输入: 背包容量:100 物品价值:60 100 120 物品重量:10 20 30-Dynamic programming solution of knapsack problem. Results for example 1、enter: backpack size: 100 items Value: 60 100 120 items Weight: 10 20 30
knapsackproblem
- 有不同重量的物品n件,求从这n件物品中任取一部分物品放入背包,使选中的物品的总重量不超过指定的限制重量,但选中物品的价值之合为最大。即任意给定物品个数及它们的重量和价值,在最大的限制重量一定的情况下,为了使价值最大,选出最优解。-There are different weights of items n pieces from n items in order to obtain any portion of the goods into the backpack, so that the
Pack
- dd大牛写的背包九讲。 很经典也很重要的ACM竞赛学习资料。-dd wrote large cattle backpack nine speakers. Classic is also very important to learning materials ACM contest.
2
- 基于背包和椭圆曲线的代理数字签名方案。结合椭圆曲线数字签名方案和变形的背包问题,提出了一种改进的椭国曲线数字签名 方案.-Backpack and the elliptic curve based on the proxy digital signature scheme. Combination of elliptic curve digital signature scheme and deformation of the knapsack problem, put forward an
beibao
- DD大牛的背包九讲,从01背包逐渐深入,完整的阐述了各种背包问题-backpack 9
backpack-ga-algorithm
- 背包问题或0-1背包问题遗传算法程序,里面用的实数编码方式值得借鉴。-0-1 knapsack problem or knapsack problem genetic algorithm procedure, which uses real coding can be learned.