[1]LIU H Y, NIE S Z. Solving the 0-1 knapsack problem with polynomial-time quantum algorithm[C]// Proceedings of the Communications in Computer and Information Science. Berlin: Springer, 2012:377-384.[2]王娜,向凤红,毛剑琳. 改进的自适应遗传算法求解0-1背包问题[J]. 计算机应用,2012, 32(6):1682-1684.[3]马炫,刘庆.求解多背包问题的人工鱼群算法[J]. 计算机应用, 2010, 30(2):469-471,494.[4]SINGH R P. Solving 0-1 knapsack problem using genetic algorithms[C]// Proceedings of the 3rd International Conference on Communication Solfware and Networks. Piscataway, NJ: IEEE Press, 2011:591-595.[5]ZHONG Y H, NIE S Z. Polynomial-time quantum algorithms for the 0-1 knapsack problem[J]. Research Journal of Applied Sciences, Engineering and Technology, 2012, 4(5):510-512.[6]田建立,晁学鹏.求解0-1背包问题的混沌遗传算法[J].计算机应用研究, 2012, 28(8): 2838-2839, 2879.[7]WANG R, GUO N, XIANG F H, et al. An improved quantum genetic algorithm with mutation and its application to 0-1 knapsack problem[C]// Proceedings of 2012 International Conference on Measurement, Information and Control. Piscataway, NJ: IEEE Press, 2012:484-488.[8]BASU S K, BHATIA A K. A naive genetic approach for non-stationary constrained problems[J]. Soft Computing, 2006, 10(2):152-162.[9]SIMOES A, COSTA E. Improving the genetic algorithm's performance when using transformation [C]// Proceedings of the Sixth International Conference on Neural Networks and Genetic Algorithms. Piscataway, NJ: IEEE Press, 2003:175-181.[10]SIMOES A, COSTA E. An immune system-based genetic algorithm to deal with dynamic environment: diversity and memory [C]// Proceedings of the Sixth International Conference on Neural Networks and Genetic Algorithms. Piscataway, NJ: IEEE Press, 2003: 168-174.[11]王则林, 吴志健. 格雷码混合遗传算法求解0-1背包问题[J]. 计算机应用研究, 2012, 29(8):2906-2908.[12]BORRADAILE G, HEERINGA B, WILFONG G. The knapsack problem with neighbour constraints[J]. Journal of Discrete Algorithms, 2012, 16:224-235.[13]王晓东. 计算机算法设计与分析[M]. 北京:电子工业出版社, 2004.[14]钱淑渠, 武慧虹, 涂歆. 动态免疫优化算法及其在背包问题中的应用[J]. 计算机工程, 2011, 37(20):216-218,222. |