文件名称:mathmodel2
介绍说明--下载内容来自于网络,使用问题请自行百度
1.1 背包问题
有一个徒步旅行者,已知他能承受的旅行背包的重量不超过a(kg)。设有n种物品可供他选择装入背包,这n种物品分别编号为1,2,…,n。其中第i种物品每件的重量为ai(kg),其使用价值(指一件第i种物品对旅行者来说所带来的好处的一种数量指标)为ci(i=1,2,…,n)。问这位旅行者应如何选择携带这n种物品的件数,使得总价值最大?
-1.1 knapsack problem is a hikers. he is known to travel to withstand the weight of the backpack not exceed a (kg). N Species with articles for his choice loaded backpack, n product were numbered 1, 2, ..., n. I first of which product each ai of the weight (kg), its value (i refers to a section of the types of items travelers the benefits brought by a number of indicators) for the ci (i = 1, 2, ..., n). Asked how travelers who choose to bring this product to the n pieces, making the total value of the largest?
有一个徒步旅行者,已知他能承受的旅行背包的重量不超过a(kg)。设有n种物品可供他选择装入背包,这n种物品分别编号为1,2,…,n。其中第i种物品每件的重量为ai(kg),其使用价值(指一件第i种物品对旅行者来说所带来的好处的一种数量指标)为ci(i=1,2,…,n)。问这位旅行者应如何选择携带这n种物品的件数,使得总价值最大?
-1.1 knapsack problem is a hikers. he is known to travel to withstand the weight of the backpack not exceed a (kg). N Species with articles for his choice loaded backpack, n product were numbered 1, 2, ..., n. I first of which product each ai of the weight (kg), its value (i refers to a section of the types of items travelers the benefits brought by a number of indicators) for the ci (i = 1, 2, ..., n). Asked how travelers who choose to bring this product to the n pieces, making the total value of the largest?
(系统自动生成,下载前可以参看下载内容)
下载文件列表
程序说明 .doc
beibao.m
www.dssz.com.txt
beibao.m
www.dssz.com.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.