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]
- 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]
- 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]
- A Variable Relationship Excavating Based Optimization Algorithm for Solving 0-1 Knapsack ProblemsMinyi Zheng, Fangqing Gu, Xuesong Chen, Hao-Tian Wu. ifip8-3 2019: 36-39 [doi]
- Multi-swarm improved moth-flame optimization algorithm with chaotic grouping and Gaussian mutation for solving engineering optimization problemsXiaodong Zhao, Yiming Fang, Shuidong Ma, Zhendong Liu. eswa, 204:117562, 2022. [doi]