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:

Solving 0-1 knapsack problem by greedy degree and expectation efficiency
Jianhui Lv, Xingwei Wang, Min Huang, et al.
Applied Soft Computing (2015) Vol. 41, pp. 94-103
Open Access | Times Cited: 36

Showing 1-25 of 36 citing articles:

Putting Continuous Metaheuristics to Work in Binary Search Spaces
Broderick Crawford, Ricardo Soto, Gino Astorga, et al.
Complexity (2017) Vol. 2017, pp. 1-19
Open Access | Times Cited: 168
A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem
Mohamed Abdel‐Basset, Syed Bilal Hussain Shah, Arun Kumar Sangaiah
International Journal of Machine Learning and Cybernetics (2017) Vol. 10, Iss. 3, pp. 495-514
Closed Access | Times Cited: 94
Scheduling of fog networks with optimized knapsack by symbiotic organisms search
Dadmehr Rahbari, Mohsen Nickray
(2017), pp. 278-283
Closed Access | Times Cited: 93
Optimizing warehouse space allocation to maximize profit in the postal industry
Jawad Hyder, Elkafi Hassini
Transportation Research Part E Logistics and Transportation Review (2025) Vol. 195, pp. 103924-103924
Open Access
A modified artificial bee colony approach for the 0-1 knapsack problem
Jie Cao, Baoqun Yin, Xiaonong Lu, et al.
Applied Intelligence (2017) Vol. 48, Iss. 6, pp. 1582-1595
Closed Access | Times Cited: 48
Minimum cost of job assignment in polynomial time by adaptive unbiased filtering and branch-and-bound algorithm with the best predictor
Jeeraporn Werapun, Witchaya Towongpaichayont, Anantaporn Hanskunatai
Intelligent Systems with Applications (2025), pp. 200502-200502
Open Access
Solving 0–1 knapsack problem by binary flower pollination algorithm
Mohamed Abdel‐Basset, Syed Bilal Hussain Shah, Ibrahim Elhenawy
Neural Computing and Applications (2018) Vol. 31, Iss. 9, pp. 5477-5495
Closed Access | Times Cited: 42
Binary Electric Eel Foraging Optimization Algorithm for Solving 0-1 Knapsack Problems
Abdelhadi Limane, Farouq Zitouni, Aridj Ferhat, et al.
(2024), pp. 1-7
Closed Access | Times Cited: 3
Data-Driven Resilient Fleet Management for Cloud Asset-enabled Urban Flood Control
Gangyan Xu, Junwei Wang, George Q. Huang, et al.
IEEE Transactions on Intelligent Transportation Systems (2017) Vol. 19, Iss. 6, pp. 1827-1838
Closed Access | Times Cited: 36
Heuristics-based influence maximization for opinion formation in social networks
Qiang He, Xingwei Wang, Min Huang, et al.
Applied Soft Computing (2018) Vol. 66, pp. 360-369
Closed Access | Times Cited: 29
Diversity-driven automated web API recommendation based on implicit requirements
Huaizhen Kou, Jian Xu, Lianyong Qi
Applied Soft Computing (2023) Vol. 136, pp. 110137-110137
Closed Access | Times Cited: 8
Solving 0–1 Knapsack Problems by Binary Dragonfly Algorithm
Mohamed Abdel‐Basset, Qifang Luo, Fahui Miao, et al.
Lecture notes in computer science (2017), pp. 491-502
Closed Access | Times Cited: 22
Nature-inspired algorithms for 0-1 knapsack problem: A survey
Yongquan Zhou, Yan Shi, Yuanfei Wei, et al.
Neurocomputing (2023) Vol. 554, pp. 126630-126630
Closed Access | Times Cited: 4
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem
Méziane Aı̈der, Oussama Gacem, Mhand Hifi
Journal of the Operational Research Society (2020) Vol. 73, Iss. 3, pp. 540-557
Closed Access | Times Cited: 10
A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem
Xavier Sánchez-Díaz, José Carlos Ortíz-Bayliss, Iván Amaya, et al.
Applied Sciences (2021) Vol. 11, Iss. 21, pp. 10209-10209
Open Access | Times Cited: 9
Hardware accelerator for solving 0–1 knapsack problems using binary harmony search
Mohammed El‐Shafei, Imtiaz Ahmad, Mohammad Gh. Alfailakawi
International Journal of Parallel Emergent and Distributed Systems (2017) Vol. 33, Iss. 1, pp. 87-102
Closed Access | Times Cited: 8
IIMOF: An Iterative Framework to Settle Influence Maximization for Opinion Formation in Social Networks
Qiang He, Xingwei Wang, Chuangchuang Zhang, et al.
IEEE Access (2018) Vol. 6, pp. 49654-49663
Open Access | Times Cited: 8
A Hybrid BPSO-GA Algorithm for 0-1 Knapsack Problems
Jinshui Wang, Jianhua Liu, Jeng‐Shyang Pan, et al.
Advances in intelligent systems and computing (2017), pp. 344-351
Closed Access | Times Cited: 7
A Heuristic Transferring Strategy for Heterogeneous-Cached ICN
Yulan Zhao, Jianhui Lv
IEEE Access (2020) Vol. 8, pp. 82421-82431
Open Access | Times Cited: 7
A probabilistic solution discovery algorithm for solving 0-1 knapsack problem
Fangxia Hu
International Journal of Parallel Emergent and Distributed Systems (2017) Vol. 33, Iss. 6, pp. 618-626
Closed Access | Times Cited: 5
An Efficient Modeling and Optimization Approach for Pressure Testing During Reentry Operation of Deepwater Drilling Riser System
Kang Liu, Guoming Chen, Weiming Shao
IEEE Access (2020) Vol. 8, pp. 74759-74770
Open Access | Times Cited: 5
Parallel time–space reduction by unbiased filtering for solving the 0/1-Knapsack problem
Patcharin Buayen, Jeeraporn Werapun
Journal of Parallel and Distributed Computing (2018) Vol. 122, pp. 195-208
Closed Access | Times Cited: 5
A Multi-Branch-and-Bound Binary Parallel Algorithm to Solve the Knapsack Problem 0–1 in a Multicore Cluster
José Dı́az, Marco Antonio Cruz‐Chávez, Jacqueline López-Calderón, et al.
Applied Sciences (2019) Vol. 9, Iss. 24, pp. 5368-5368
Open Access | Times Cited: 5
A Quartile-Based Hyper-heuristic for Solving the 0/1 Knapsack Problem
Fernando Gómez-Herrera, Rodolfo A. Ramírez-Valenzuela, José Carlos Ortíz-Bayliss, et al.
Lecture notes in computer science (2018), pp. 118-128
Closed Access | Times Cited: 4
An adaptive approach for handling two‐dimension influence maximization in social networks
Qiang He, Xingwei Wang, Min Huang, et al.
International Journal of Communication Systems (2018) Vol. 31, Iss. 15
Closed Access | Times Cited: 4
Page 1 - Next Page

Scroll to top