Discussion on Knapsack Problem Optimization Algorithm Based on Complex Network

Abstract:

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.

• Periodical: Applied Mechanics and Materials (Volumes 556-562)
• Pages: 3354-3356
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.556-562.3354
• Online since: May 2014
• Authors: Meng Xiao*, Yun Yao Zhou
• Keywords: Complex Network, Knapsack Problem, Optimization Algorithm

References

[1] Shi Jinchi, Research on Pragmatic Algorithm in the Resolution of KnapsackProblem, (2004).

[2] Chu P C, Beasley J E. A Genetic Algorithm for the Multidimensional Knapsack Problem[J]. Journal of Heuristics, 1998, 4: 63-86.

[3] Watts D, Collective Dynamics of Small World Networks[J]. Nature, 1998, 393, 440-442.

[4] Chen Naijian, Knapsack Problem Optimization Based on Characters of Complex Network, (2009).