[1]MARTELLO S,TOTH P.An upper bound of Zero-one knapsack problem and a branch and bound algorithm[J].European Journal of Operational Research,1977,1(3):169-175.
[2]ZOU Dexuan,GAO Liqun,LI Steven,et al.Solving 0-1 knapsack problem by a novel global harmony search algorithm[J].Applied Soft Computing,2011,11(2):1556-1564.
[3]TUNG Khactruong,LI Kenli,XU Yuming.Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem[J].Applied Soft Computing,2013,13(4):1774-1780.
[4]BALAS E,ZEMEL E.An algorithm of large zero-one knapsack problems[J].Operation Researeh,1980,16(1):196-200.
[5]ZHANG Xiaoge,HUANG Shiyan,HU Yong,et al.Solving 0-1 knapsack problems based on amoeboid organism algorithm[J].Applied Mathematics and Computation,2013,219(19):9959-9970.
[6]RAJA B S,KANNAN K.A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles[J].Applied Mathematics and Computation,2008,20(11):71-77.
[7]YANG Zhen,WANG Guoqing,CHU Feng.An effective GRASP and tabu search for the 0-1 quadratic knapsack problem[J].Computers & Operations Research,2013,40(5):1176-1185.
[8]LUCAS LTOCART,ANASS NAGIH,GRARD PLATEAU.Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem[J].Computers & Operations Research,2012,39(1):12-18.
[9]RAJEEV K,SINGH P K.Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms[J].Applied Soft Computing,2010,10
(3):711-718.
[10]JULIEN R,JOS RUI FIGUEIRA,YVES D S.The inverse 0-1 knapsack problem:Theory,algorithms and computational experiments[J].Discrete Optimization,2013,10(2):181-192.
[11]金慧敏,马良.遗传退火进化算法在背包问题中的应用[J].上海理工大学学报,2004,26(6):561-564.
[12]刘漫丹.文化基因算法在多约束背包问题中的应用[J].计算技术与自动化,2007,26(4):61-67.
[13]张宗飞.求解组合优化问题的改进型量子进化算法[J].计算机工程与设计,2010,31(17):3891-3894.
[14]贺毅朝,刘坤起,张翠军.求解背包问题的贪心遗传算法及其应用[J].计算机工程与设计,2007,28(11):2655-2657.
[15]赵新超,韩宇,艾文宝.求解背包问题的一种改进遗传算法[J].计算机工程与应用,2011,47(24):34-36.
[16]钱淑渠,武慧虹,涂歆.动态免疫优化算法及其在背包问题中的应用[J].计算机工程,2011,37(20):216-218. |