| GUDER J. Discounted Knapsack Problem for Pairs of Items[D]. Nuremberg: University of Erlangen-Nurnberg, 2005. |
| GULDAN B. Heuristic and Exact Algorithms for Discounted Knapsack Problems[D]. Nuremberg: University of Erlangen-Nurnberg, 2007. |
| 贺毅朝, 王熙照, 李文斌, 等. 基于遗传算法求解折扣{0-1}背包问题的研究[J]. 计算机学报, 2016, 39(12): 2614-2630. doi: 10.11897/SP.J.1016.2016.02614 |
| 杨洋, 潘大志, 刘益, 等. 折扣{0-1}背包问题的简化新模型及遗传算法求解[J]. 计算机应用, 2019, 39(3): 656-662. |
| RONG A Y, 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. doi: 10.1016/j.amc.2011.12.068 |
| 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. doi: 10.1016/j.ins.2016.07.037 |
| 杨洋, 潘大志, 贺毅朝. 改进修复策略遗传算法求解折扣{0-1}背包问题[J]. 计算机工程与应用, 2018, 54(21): 37-42, 132. doi: 10.3778/j.issn.1002-8331.1711-0255 |
| 冯艳红, 杨娟, 贺毅朝, 等. 差分进化帝王蝶优化算法求解折扣{0-1}背包问题[J]. 电子学报, 2018, 46(6): 1343-1350. doi: 10.3969/j.issn.0372-2112.2018.06.010 |
| 张琴, 潘大志. 扩展SD{0-1}KP背包问题的建模及其遗传算法求解[J]. 西华师范大学学报(自然科学版), 2020, 41(2): 214-220. |
| NAUSS R M. The 0-1 Knapsack Problem with Multiple Choice Constraints[J]. European Journal of Operational Research, 1978, 2(2): 125-131. doi: 10.1016/0377-2217(78)90108-X |
| PISINGER D. A Minimal Algorithm for the Multiple-Choice Knapsack Problem[J]. European Journal of Operational Research, 1995, 83(2): 394-410. doi: 10.1016/0377-2217(95)00015-I |
| NAUSS R M. The 0-1 Knapsack Problem with Multiple Choice Constraints[J]. European Journal of Operational Research, 1978, 2(2): 125-131. doi: 10.1016/0377-2217(78)90108-X |
| BALINTFY J L, ROSS G T, SINHA P, et al. A Mathematical Programming System for Preference and Compatibility Maximized Menu Planning and Scheduling[J]. Mathematical Programming, 1978, 15(1): 63-76. doi: 10.1007/BF01609000 |
| SINHA P, ZOLTNERS A A. The Multiple-Choice Knapsack Problem[J]. Operations Research, 1979, 27(3): 503-515. doi: 10.1287/opre.27.3.503 |
| 杨洋. 改进帕累托算法求解超大规模多选择背包问题[J]. 电子学报, 2020, 48(6): 1205-1212. doi: 10.3969/j.issn.0372-2112.2020.06.023 |