An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems. - Yanhong Feng 002; Ke Jia; Yichao He (Comput. Intell. Neurosci., 2014)

An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems. - Yanhong Feng 002; Gai-Ge Wang; Qingjiang Feng; Xiang-Jun Zhao (Comput. Intell. Neurosci., 2014)

A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems. - Yanhong Feng 002; Gai-Ge Wang; Xiao-Zhi Gao 001 (Int. J. Comput. Intell. Syst., 2016)

Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization. - Yanhong Feng 002; Gai-Ge Wang; Suash Deb; Mei Lu; Xiang-Jun Zhao (Neural Comput. Appl., 2017)

Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem. - Yanhong Feng 002; Gai-Ge Wang (IEEE Access, 2018)

Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem. - Yanhong Feng 002; Gai-Ge Wang; Junyu Dong; Ling Wang 001 (Comput. Electr. Eng., 2018)

Solving randomized time-varying knapsack problems by a novel global firefly algorithm. - Yanhong Feng 002; Gai-Ge Wang; Ling Wang 001 (Eng. Comput., 2018)

Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation. - Yanhong Feng 002; Juan Yang; Congcong Wu; Mei Lu; Xiang-Jun Zhao (Memetic Comput., 2018)

Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem. - Yanhong Feng 002; Gai-Ge Wang; Wenbin Li; Ning Li (Neural Comput. Appl., 2018)

Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems. - Yanhong Feng 002; Jiao-Hong Yi; Gai-Ge Wang (IEEE Access, 2019)

Monarch butterfly optimization: A comprehensive review. - Yanhong Feng 002; Suash Deb; Gai-Ge Wang; Amir Hossein Alavi (Expert Syst. Appl., 2021)

A binary moth search algorithm based on self-learning for multidimensional knapsack problems. - Yanhong Feng 002; Gai-Ge Wang (Future Gener. Comput. Syst., 2022)