The following publications are possibly variants of this publication:
- Correction to: TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problemsYan Kang, Haining Wang, Bin Pu, Jiansong Liu, Shin-Jye Lee, Xuekun Yang, Liu Tao. nca, 35(17):12715, June 2023. [doi]
- Exact and approximate algorithms for discounted {0-1} knapsack problemYi-Chao He, Xi-Zhao Wang, Yu-Lin He, Shu-Liang Zhao, Wen-Bin Li. isci, 369:634-647, 2016. [doi]
- "Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm"Congcong Wu, Jianli Zhao, Yanhong Feng, Malrey Lee. apin, 50(6):1872-1888, 2020. [doi]
- Binary Moth Search Algorithm for Discounted {0-1} Knapsack ProblemYanhong Feng, Gai-Ge Wang. access, 6:10708-10719, 2018. [doi]
- Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problemYanhong Feng, Gai-Ge Wang, Wenbin Li, Ning Li. nca, 30(10):3019-3036, 2018. [doi]