[1] FAYARD D, PLATEAU G. Resolution of the 0-1 knapsack problem:comparison of methods[J]. Mathematical Programming, 1975, 8(1):272-307. [2] CHU P C, BEASLEY J E. A genetic algorithm for the multidimensional knapsack problem[J]. Journal of Heuristics, 1998, 4(1):63-86. [3] CHEN Y, HAO J-K. An iterated "hyperplane exploration" approach for the quadratic knapsack problem[J]. Computers & Operations Research, 2017, 77:226-239. [4] HILEY A, JULSTROM B A. The quadratic multiple knapsack problem and three heuristic approaches to it[C]//GECCO'06:Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation. New York:ACM, 2006:547-552. [5] GULDAN B. Heuristic and exact algorithms for discounted knapsack problems[D]. Erlangen and Nuremberg, Bavaria, Germany:University of Erlangen-Nürnberg, 2007:1-78. [6] RONG A, FIGUEIRA J R, KLAMROTH K. Dynamic programming based algorithms for the discounted {0-1} knapsack problem[J]. Applied Mathematics and Computation, 2012, 218(12):6921-6933. [7] 贺毅朝,王熙照,李文斌,等.基于遗传算法求解折扣{0-1}背包问题的研究[J].计算机学报,2016,39(12):2614-2630. (HE Y C, WANG X Z, LI W B, et al. Research on genetic algorithms for the discounted {0-1} knapsack problem[J]. Chinese Journal of Computers, 2016, 39(12):2614-2630.) [8] HE Y-C, WANG X-Z, HE Y-L, et al. Exact and approximate algorithms for discounted {0-1} knapsack problem[J]. Information Sciences, 2016, 369:634-647. [9] 刘雪静,贺毅朝,吴聪聪,等.基于细菌觅食算法求解折扣{0-1}背包问题的研究[J/OL]. 计算机工程与应用(2017-02-16)[2017-08-30]. http://kns.cnki.net/kcms/detail/11.2127.TP.20170216.1044.038.html. (LIU X J, HE Y C, WU C C, et al. Research on bacterial foraging optimization algorithm for the discounted {0-1} knapsack problem[J/OL]. Computer Engineering and Applications (2017-02-16)[2017-08-18]. http://kns.cnki.net/kcms/detail/11.2127.TP.20170216.1044.038.html.) [10] 吴聪聪,贺毅朝,陈嶷瑛,等.变异蝙蝠算法求解折扣{0-1}背包问题[J].计算机应用,2017,37(5):1292-1299. (WU C C, HE Y C, CHEN Y Y, et al. Mutated bat algorithm for solving the discounted {0-1} KP[J]. Journal of Computer Applications, 2017, 37(5):1292-1299.) [11] ZHU H, HE Y, WANG X, et al. Discrete differential evolutions for the discounted {0-1} knapsack problem[J]. International Journal of Bio-inspired Computation, 2017, 10(4):219-238. [12] ASKARZADEH A. A novel metaheuristic method for solving constrained engineering optimization problems:crow search algorithm[J]. Computers & Structures, 2016, 169:1-12. [13] 贺毅朝,王熙照,寇应展.一种具有混合编码的二进制差分演化算法[J].计算机研究与发展,2007,44(9):1476-1484. (HE Y C,WANG X Z, KOU Y Z. A binary differential evolution algorithm with hybrid encoding[J]. Journal of Computer Research and Development, 2007, 44(9):1467-1484.) [14] REYNOLDS A M. Cooperative random Lévy flight searches and the flight patterns of honeybees[J]. Physics Letters A, 2006, 354(5/6):384-388. [15] YANG X-S, DEB S. Cuckoo search via Lévy flights[C]//NaBIC 2009:Proceedings of the 2009 World Congress on Nature & Biologically Inspired Computing. Piscataway, NJ:IEEE, 2009:210-214. [16] NOMAN N, IBA H. Enhancing differential evolution performance with local search for high dimensional function optimization[C]//GECCO'05:Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation. New York:ACM, 2005:967-974. [17] 刘雪静,贺毅朝,路凤佳,等.基于差分策略的混沌乌鸦算法求解折扣{0-1}背包问题[J].计算机应用,2018,38(1):137-145. (LIU X J, HE Y C, LU F J, et al, Chaotic crow search algorithm based on differential evolution strategy for solving discount {0-1} knapsack problem[J]. Journal of Computer Applications, 2018, 38(1):137-145.) |