QQ客服 官方微博 反馈留言

	An improved monkey algorithm for a 0-1 knapsack problem
	Zhou, Yongquan; Chen, Xin; Zhou, Guo
刊名	APPLIED SOFT COMPUTING
	2016
卷号	38页码:817-830
关键词	Monkey algorithm Binary version of the monkey algorithm Knapsack problem Cooperation process Greedy strategy
ISSN号	1568-4946
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/4365085
专题	大连理工大学
作者单位	1.Guangxi Univ Nationalities, Coll Informat Sci & Engn, Nanning 530006, Guangxi, Peoples R China. 2.Guangxi Univ Nationalities, Coll Informat Sci & Engn, Nanning 530006, Guangxi, Peoples R China. 3.Dalian Univ Technol, Sch Software, Dalian 116024, Peoples R China. 4.Chinese Acad Sci, Inst Comp Technol, Beijing 100081, Peoples R China.
推荐引用方式 GB/T 7714	Zhou, Yongquan,Chen, Xin,Zhou, Guo. An improved monkey algorithm for a 0-1 knapsack problem[J]. APPLIED SOFT COMPUTING,2016,38:817-830.
APA	Zhou, Yongquan,Chen, Xin,&Zhou, Guo.(2016).An improved monkey algorithm for a 0-1 knapsack problem.APPLIED SOFT COMPUTING,38,817-830.
MLA	Zhou, Yongquan,et al."An improved monkey algorithm for a 0-1 knapsack problem".APPLIED SOFT COMPUTING 38(2016):817-830.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。