| CONNOLLY D, MARTELLO S, TOTH P. Knapsack Problems: Algorithms and Computer Implementations[J]. The Journal of the Operational Research Society, 1991, 42(6): 513. doi: 10.1057/jors.1991.99 |
| 徐小平, 庞润娟, 王峰, 等.求解0-1背包问题的烟花算法[J].计算机系统应用, 2019, 28(2): 166-172. |
| KELLERER H, PFERSCHY U, PISINGER D. The Bounded Knapsack Problem[M]//Knapsack Problems. Berlin: Springer, 2004: 185-209. |
| 贺毅朝, 王熙照, 李文斌, 等.基于遗传算法求解折扣{0-1}背包问题的研究[J].计算机学报, 2016, 39(12): 2614-2630. |
| PISINGER D. A Minimal Algorithm for the Bounded Knapsack Problem[M]//Integer Programming and Combinatorial Optimization. Berlin: Springer, 1995: 95-109. |
| 贺毅朝, 李泽文, 李焕哲, 等.离散灰狼优化算法求解有界背包问题[J].计算机工程与设计, 2019, 40(4): 1008-1015. |
| LI Y, HE Y C, LI H Z, et al. A Binary Particle Swarm Optimization for Solving the Bounded Knapsack Problem[M]//Communications in Computer and Information Science. Berlin: Springer, 2019: 50-60. |
| 任静敏, 潘大志.带权重的贪心萤火虫算法求解0-1背包问题[J].计算机与现代化, 2019(5): 86-91. |
| YANG X S. Firefly Algorithm, Stochastic Test Functions and Design Optimisation[J]. International Journal of Bio-Inspired Computation, 2010, 2(2): 78-84. doi: 10.1504/IJBIC.2010.032124 |
| THIÉTART R A, FORGUES B. Chaos Theory and Organization[J]. Organization Science, 1995, 6(1): 19-31. doi: 10.1287/orsc.6.1.19 |
| 桂传志.混沌序列在优化理论中的应用[D].南京: 南京理工大学, 2006. |
| YANG X S, DEB S. Cuckoo Search via Levy Flights[C]//Proceeding of World Congress on Nature & Biologically Inspired Computing 2009. New York: IEEE Publications, 2009. |
| YANG X S. Nature-Inspired Metaheuristic Algorithms[M]. 2nd ed. Frome: Luniver Press, 2010. |
| LI M, CHEN T H. A Study of Genetic Algorithm Based on Niche Technique[J]. Advanced Materials Research, 2012, 1670: 152-155. |