Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Algorithms for randomized time-varying knapsack problems
Yichao He, Xinlu Zhang, Wenbin Li, et al.
Journal of Combinatorial Optimization (2014) Vol. 31, Iss. 1, pp. 95-117
Closed Access | Times Cited: 28

Showing 1-25 of 28 citing articles:

Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization
Yanhong Feng, Gai‐Ge Wang, Suash Deb, et al.
Neural Computing and Applications (2015) Vol. 28, Iss. 7, pp. 1619-1634
Closed Access | Times Cited: 136
A novel binary artificial bee colony algorithm for the set-union knapsack problem
Yichao He, Haoran Xie, Tak-Lam Wong, et al.
Future Generation Computer Systems (2017) Vol. 78, pp. 77-86
Closed Access | Times Cited: 99
Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem
Yanhong Feng, Gai‐Ge Wang, Wenbin Li, et al.
Neural Computing and Applications (2017) Vol. 30, Iss. 10, pp. 3019-3036
Closed Access | Times Cited: 81
Solving 0–1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation
Yanhong Feng, Juan Yang, Congcong Wu, et al.
Memetic Computing (2016) Vol. 10, Iss. 2, pp. 135-150
Closed Access | Times Cited: 80
Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem
Yanhong Feng, Gai‐Ge Wang, Junyu Dong, et al.
Computers & Electrical Engineering (2017) Vol. 67, pp. 454-468
Closed Access | Times Cited: 65
One-way mutation: an efficient strategy to improve the performance of evolutionary algorithms for solving 0-1 knapsack problem
Yichao He, Jinghong Wang, Guoxin Chen, et al.
International Journal of Machine Learning and Cybernetics (2025)
Closed Access
Group theory-based optimization algorithm for solving knapsack problems
Yichao He, Xizhao Wang
Knowledge-Based Systems (2018) Vol. 219, pp. 104445-104445
Closed Access | Times Cited: 47
A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem
Geng Lin, Jian Guan, Zuoyong Li, et al.
Expert Systems with Applications (2019) Vol. 135, pp. 201-211
Closed Access | Times Cited: 42
Exact and approximate algorithms for discounted {0-1} knapsack problem
Yichao He, Xizhao Wang, Yulin He, et al.
Information Sciences (2016) Vol. 369, pp. 634-647
Closed Access | Times Cited: 42
Randomized time‐varying knapsack problems via binary beetle antennae search algorithm: Emphasis on applications in portfolio insurance
Marina A. Medvedeva, Vasilios N. Katsikis, Spyridon D. Mourtas, et al.
Mathematical Methods in the Applied Sciences (2020) Vol. 44, Iss. 2, pp. 2002-2012
Closed Access | Times Cited: 38
Solving randomized time-varying knapsack problems by a novel global firefly algorithm
Yanhong Feng, Gai‐Ge Wang, Ling Wang
Engineering With Computers (2017) Vol. 34, Iss. 3, pp. 621-635
Closed Access | Times Cited: 34
A Novel Monarch Butterfly Optimization with Global Position Updating Operator for Large-Scale 0-1 Knapsack Problems
Yanhong Feng, Xu Yu, Gai‐Ge Wang
Mathematics (2019) Vol. 7, Iss. 11, pp. 1056-1056
Open Access | Times Cited: 33
Two neural dynamics approaches for computing system of time-varying nonlinear equations
Xiuchun Xiao, Dongyang Fu, Guancheng Wang, et al.
Neurocomputing (2020) Vol. 394, pp. 84-94
Closed Access | Times Cited: 29
“Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm”
Congcong Wu, Jianli Zhao, Yanhong Feng, et al.
Applied Intelligence (2020) Vol. 50, Iss. 6, pp. 1872-1888
Closed Access | Times Cited: 23
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Husheng Wu, Renbin Xiao
Research (2020) Vol. 2020
Open Access | Times Cited: 21
A general approach to solving hardware and software partitioning problem based on evolutionary algorithms
Qinglei Zhai, Yichao He, Gai‐Ge Wang, et al.
Advances in Engineering Software (2021) Vol. 159, pp. 102998-102998
Closed Access | Times Cited: 13
Estimation of Distribution Algorithm Based on Lévy Flight for Solving the Set-Union Knapsack Problem
Xue-Jing Liu, Yichao He
IEEE Access (2019) Vol. 7, pp. 132217-132227
Open Access | Times Cited: 11
Exact algorithms for the 0–1 Time-Bomb Knapsack Problem
Michele Monaci, Ciara Pike-Burke, Alberto Santini
Computers & Operations Research (2022) Vol. 145, pp. 105848-105848
Open Access | Times Cited: 6
Fitness-Based Acceleration Coefficients Binary Particle Swarm Optimization (FACBPSO) to Solve the Discounted Knapsack Problem
Adel Sulaiman, Marium Sadiq, Yasir Mehmood, et al.
Symmetry (2022) Vol. 14, Iss. 6, pp. 1208-1208
Open Access | Times Cited: 6
A hybrid grey wolf optimizer for solving the product knapsack problem
Zewen Li, Yichao He, Ya Li, et al.
International Journal of Machine Learning and Cybernetics (2020) Vol. 12, Iss. 1, pp. 201-222
Closed Access | Times Cited: 8
A Novel Discrete Grey Wolf Optimizer for Solving the Bounded Knapsack Problem
Zewen Li, Yichao He, Huanzhe Li, et al.
Communications in computer and information science (2019), pp. 101-114
Closed Access | Times Cited: 7
Set algebra — based algebraic evolutionary algorithm for binary optimization problems
Yichao He, Hailu Sun, Yuan Wang, et al.
Applied Soft Computing (2023) Vol. 143, pp. 110425-110425
Closed Access | Times Cited: 2
A Binary Particle Swarm Optimization for Solving the Bounded Knapsack Problem
Ya Li, Yichao He, Huanzhe Li, et al.
Communications in computer and information science (2019), pp. 50-60
Closed Access | Times Cited: 5
An improved group theory-based optimization algorithm for discounted 0-1 knapsack problem
Ran Wang, Zichao Zhang, Wing W. Y. Ng, et al.
Advances in Computational Intelligence (2021) Vol. 1, Iss. 5
Open Access | Times Cited: 5
An Improved Hybrid Encoding Firefly Algorithm for Randomized Time-Varying Knapsack Problems
Yanhong Feng, Gai‐Ge Wang
(2015) Vol. 41, pp. 9-14
Closed Access | Times Cited: 3
Page 1 - Next Page

Scroll to top