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:

A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0–1 knapsack problems
Bilal Ervural, Hüseyin Haklı
Computers & Industrial Engineering (2023) Vol. 178, pp. 109080-109080
Closed Access | Times Cited: 18

Showing 18 citing articles:

Reptile Search Algorithm: Theory, Variants, Applications, and Performance Evaluation
Buddhadev Sasmal, Abdelazim G. Hussien, Arunita Das, et al.
Archives of Computational Methods in Engineering (2023) Vol. 31, Iss. 1, pp. 521-549
Closed Access | Times Cited: 25

A novel binary Kepler optimization algorithm for 0–1 knapsack problems: Methods and applications
Mohamed Abdel‐Basset, Reda Mohamed, Ibrahim M. Hezam, et al.
Alexandria Engineering Journal (2023) Vol. 82, pp. 358-376
Open Access | Times Cited: 15

An Improved Binary Quadratic Interpolation Optimization for 0-1 Knapsack Problems
S. H. Salem
Sustainable Machine Intelligence Journal (2023) Vol. 4
Open Access | Times Cited: 12

A binary sparrow search algorithm for feature selection on classification of X-ray security images
Ahmet Babalık, Aybuke Babadag
Applied Soft Computing (2024) Vol. 158, pp. 111546-111546
Closed Access | Times Cited: 4

A new binary coati optimization algorithm for binary optimization problems
Gülnur Yıldızdan, Emine Baş
Neural Computing and Applications (2023) Vol. 36, Iss. 6, pp. 2797-2834
Closed Access | Times Cited: 10

A novel improved lemurs optimization algorithm for feature selection problems
Ra’ed M. Al-Khatib, Nour Alqudah, Mahmoud Saleh Jawarneh, et al.
Journal of King Saud University - Computer and Information Sciences (2023) Vol. 35, Iss. 8, pp. 101704-101704
Open Access | Times Cited: 8

An Efficient Binary Hybrid Equilibrium Algorithm for Binary Optimization Problems: Analysis, Validation, and Case Studies
Mohamed Abdel‐Basset, Reda Mohamed, Ibrahim M. Hezam, et al.
International Journal of Computational Intelligence Systems (2024) Vol. 17, Iss. 1
Open Access | Times Cited: 1

Reptile Search Algorithm Considering Different Flight Heights to Solve Engineering Optimization Design Problems
Liguo Yao, Guanghui Li, Panliang Yuan, et al.
Biomimetics (2023) Vol. 8, Iss. 3, pp. 305-305
Open Access | Times Cited: 4

Binary metaheuristic algorithms for 0–1 knapsack problems: Performance analysis, hybrid variants, and real-world application
Mohamed Abdel‐Basset, Reda Mohamed, Safaa Saber, et al.
Journal of King Saud University - Computer and Information Sciences (2024) Vol. 36, Iss. 6, pp. 102093-102093
Open Access | Times Cited: 1

A new binary arithmetic optimization algorithm for uncapacitated facility location problem
Emine Baş, Gülnur Yıldızdan
Neural Computing and Applications (2023) Vol. 36, Iss. 8, pp. 4151-4177
Closed Access | Times Cited: 3

The Enhanced Binary Mountain Gazelle Optimization Algorithm for 0-1 Knapsack Problems
Emine Baş, Aysegul IHSAN
Research Square (Research Square) (2024)
Open Access

Automated Design of Collaboration-Based Hybrid Metaheuristics
Yipeng Wang, Bin Xin, Bo Liu, et al.
IEEE Transactions on Cybernetics (2024) Vol. 54, Iss. 12, pp. 7877-7890
Closed Access

An effective binary dynamic grey wolf optimization algorithm for the 0-1 knapsack problem
Feyza Erdoğan, Murat Karakoyun, Şaban Gülcü
Multimedia Tools and Applications (2024)
Closed Access

List-Based Threshold Accepting Algorithm with Improved Neighbor Operator for 0–1 Knapsack Problem
Liangcheng Wu, Kai Lin, Xiaoyu Lin, et al.
Algorithms (2024) Vol. 17, Iss. 11, pp. 478-478
Open Access

Page 1

Scroll to top