Discussion on Knapsack Problem Optimization Algorithm Based on Complex Network

被引：0

作者：

Xiao Meng ^{[1
]}

Zhou Yunyao ^{[2
]}

机构：

[1] Wuhan Univ Technol, Int Educ Coll, Wuhan 430070, Hubei, Peoples R China

[2] Wuhan Univ Technol, Informat Engn Coll, Wuhan 430070, Hubei, Peoples R China

来源：

MECHATRONICS ENGINEERING, COMPUTING AND INFORMATION TECHNOLOGY | 2014年 / 556-562卷

关键词：

Knapsack problem; optimization algorithm; complex network;

D O I：

10.4028/www.scientific.net/AMM.556-562.3354

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This passage is to put forward knapsack problem optimization algorithm based on complex network(KOABCN). Knapsack problem has extremely wide application in a great number of fields. For instance, knapsack problem can be applied in information coding, budget control, project choosing, material cutting, cargo loading and unloading as well as Internet information safety. Since 1950's, knapsack problem has been one of the most heated topics in algorithm and complexity research. Therefore, knapsack will still be largely focused in the next period of research.

引用

页码：3354 / +

页数：2