- 0072229810_code 24点游戏的后台开发
- local-amplify 打开Bmp形式的图片
- S_Xing 制作智能小车
- Address-method 采集了三组
- Two_Chess_game 象棋跟五子棋两个程序的源码
- deeplearing-hinton hinton2006年发表在science上的关于深度神经网络的文章Reducing the Dimensionality of Data with Neural Networks的matlab程序 mnistdeepauto.m //训练AutoEncoder的主文件 converter.m //将样本集从.ubyte格式转换成.ascii格式
文件名称:KnapsackProblem
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:950byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
问题:已知有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 i is wi. I assume that part of the item into the knapsack xi get pixi benefits, where, 0 ≤ xi ≤ 1, pi> 0. If the weight of these items is greater than M, requires that all selected items to be loaded backpack should not exceed the total weight of M, while the total load backpack items were the biggest benefits.
物品重量的和大于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 i is wi. I assume that part of the item into the knapsack xi get pixi benefits, where, 0 ≤ xi ≤ 1, pi> 0. If the weight of these items is greater than M, requires that all selected items to be loaded backpack should not exceed the total weight of M, while the total load backpack items were the biggest benefits.
相关搜索: Knapsack Java
(系统自动生成,下载前可以参看下载内容)
下载文件列表
KnapsackProblem.java
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.