- batNetVirus 一个利用windows弱密码进行传播的蠕虫
- S3C44B0X-test s3c44b0 的开发板测试的所有源代码及程序!!!汇编代码主要完成系统初始化
- 雨量等值线参考代码
- Virtual_COM_Port Source code for STM32 MCU. USB to Virtual COM port
- Ecommerce_JFS_Hibernate Ecommerce baseado em uma aplicaç ã o JAVA utilizando primefaces e hibernate e comunicaç ã o via webservice (utilizando o Axis 2). O projeto foi desenvolvido para que ecommerce e lojística realizassem comunicaç ã o para que a vitrine (ecommerce) vendesse ao cliente
- pv_2diode_det Detailed two diode model of solar cell using matlab/simulink
文件名称: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
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
