已知N种物品和一个容纳重量为M的背包,每种物品均有自己的重量和效益值,假设这N种物品的重量和有可能大于M,这种情况下,选择哪种物品装入背包能获得最大效益值...我要分享

Given n items and a backpack with a capacity weight of M, each item has its own weight and benefit v

关注次数: 217

下载次数: 0

文件大小: 6.62 kB

代码分类: 其他

开发平台: matlab

下载需要积分: 2积分

版权声明:如果侵犯了您的权益请与我们联系,我们将在24小时内删除。

代码描述

中文说明:已知N种物品和一个容纳重量为M的背包,每种物品均有自己的重量和效益值,假设这N种物品的重量和有可能大于M,这种情况下,选择哪种物品装入背包能获得最大效益值-Are known to have n kinds of goods and a weight capacity of M, backpacks, each item has its own weight and efficiency values, assume that n kinds of goods may be greater than the weight and M, such a situation, what kind of loaded goods into the backpack to get the most value?


English Description:

Are known to have n kinds of goods and a weight capacity of M, backpacks, each item has its own weight and efficiency values, assume that n kinds of goods may be greater than the weight and M, such a situation, what kind of loaded goods into the backpack to get the most value?


代码预览

相关推荐