Yanhong Feng

According to our database, Yanhong Feng authored at least 21 papers between 2001 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

A binary moth search algorithm based on self-learning for multidimensional knapsack problems.

Yanhong Feng, Gai-Ge Wang

Future Gener. Comput. Syst., 2022

2021

Monarch butterfly optimization: A comprehensive review.

Yanhong Feng, Suash Deb, Gai-Ge Wang, Amir Hossein Alavi

Expert Syst. Appl., 2021

2020

"Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm".

Congcong Wu, Jianli Zhao, Yanhong Feng, Malrey Lee

Appl. Intell., 2020

2019

Innovation mechanism of cluster industry based on weighted time-varying multi-criteria and similarity evaluation method.

Yanhong Feng, Zhongfu Wang

Int. J. Comput. Appl. Technol., 2019

Development mode of circular economy industrial cluster based on game theory.

Yanhong Feng, Zhongfu Wang

Int. J. Comput. Appl. Technol., 2019

Improved data envelopment analysis model based on geometric mean model.

Yanhong Feng, Zhongfu Wang

Int. J. Comput. Appl. Technol., 2019

Evaluation model of economic competitiveness based on multi-layer fuzzy neural network.

Zhongfu Wang, Yanhong Feng

Clust. Comput., 2019

Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems.

Yanhong Feng, Jiao-Hong Yi, Gai-Ge Wang

IEEE Access, 2019

2018

Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem.

Yanhong Feng, Gai-Ge Wang, Wenbin Li, Ning Li

Neural Comput. Appl., 2018

Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation.

Yanhong Feng, Juan Yang, Congcong Wu, Mei Lu, Xiang-Jun Zhao

Memetic Comput., 2018

基于BLSTM的命名实体识别方法 (Named Entity Recognition Method Based on BLSTM).

Yanhong Feng, Hong Yu, Geng Sun, Juanjuan Sun

计算机科学, 2018

基于非对称多值特征杰卡德系数的高维语义向量差异性度量方法 (Diversity Measures Method in High-dimensional Semantic Vector Based on Asymmetric Multi-valued Feature Jaccard Coefficient).

Yanhong Feng, Hong Yu, Geng Sun, Song Peng

计算机科学, 2018

Solving randomized time-varying knapsack problems by a novel global firefly algorithm.

Yanhong Feng, Gai-Ge Wang, Ling Wang

Eng. Comput., 2018

Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem.

Yanhong Feng, Gai-Ge Wang, Junyu Dong, Ling Wang

Comput. Electr. Eng., 2018

Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem.

Yanhong Feng, Gai-Ge Wang

IEEE Access, 2018

2017

Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization.

Yanhong Feng, Gai-Ge Wang, Suash Deb, Mei Lu, Xiang-Jun Zhao

Neural Comput. Appl., 2017

2016

A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems.

Yanhong Feng, Gai-Ge Wang, Xiao-Zhi Gao

Int. J. Comput. Intell. Syst., 2016

2014

Multi-Resolution Salient Region Detection in Frequency Domain.

Yingchun Guo, Yanhong Feng, Gang Yan, Shuo Shi

Int. J. Adv. Pervasive Ubiquitous Comput., 2014

An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems.

Yanhong Feng, Gai-Ge Wang, Qingjiang Feng, Xiang-Jun Zhao

Comput. Intell. Neurosci., 2014

An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems.

Yanhong Feng, Ke Jia, Yichao He

Comput. Intell. Neurosci., 2014

2001

Structure-based combinatorial library design: Discovery of non-peptidic inhibitors of caspases 3 and 8.

Martha S. Head, M. Dominic Ryan, Dennis Lee, Yanhong Feng, Cheryl A. Janson, Nestor O. Concha, Paul M. Keller, Walter E. deWolf Jr.

J. Comput. Aided Mol. Des., 2001