The following publications are possibly variants of this publication:
- Solving 0-1 knapsack problem by a novel binary monarch butterfly optimizationYanhong Feng, Gai-Ge Wang, Suash Deb, Mei Lu, Xiang-Jun Zhao. nca, 28(7):1619-1634, 2017. [doi]
- Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutationYanhong Feng, Juan Yang, Congcong Wu, Mei Lu, Xiang-Jun Zhao. memetic, 10(2):135-150, 2018. [doi]
- Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problemYanhong Feng, Gai-Ge Wang, Junyu Dong, Ling Wang 0001. cee, 67:454-468, 2018. [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]
- A New Monarch Butterfly Optimization Algorithm with SA StrategyXitong Wang, Xin Tian, Yonggang Zhang. ksem 2019: 250-258 [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]