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:

Swarm-Inspired Computing to Solve Binary Optimization Problems: A Backward Q-Learning Binarization Scheme Selector
Marcelo Becerra, José Lemus-Romani, Felipe Cisternas-Caneo, et al.
Mathematics (2022) Vol. 10, Iss. 24, pp. 4776-4776
Open Access | Times Cited: 9

Showing 9 citing articles:

Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics
Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, et al.
Mathematics (2024) Vol. 12, Iss. 2, pp. 262-262
Open Access | Times Cited: 9

Feature Selection Problem and Metaheuristics: A Systematic Literature Review about Its Formulation, Evaluation and Applications
José Barrera-García, Felipe Cisternas-Caneo, Broderick Crawford, et al.
Biomimetics (2023) Vol. 9, Iss. 1, pp. 9-9
Open Access | Times Cited: 12

Exploring Chaotic Binarization Rules in the Binary Fox Optimizer for Complex Optimization Problems
Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, et al.
SN Computer Science (2025) Vol. 6, Iss. 3
Closed Access

Unleashing Chaos: Enhanced Reptile Search for the Set Covering Problem
Felipe Cisternas-Caneo, José Barrera-García, Broderick Crawford, et al.
Communications in computer and information science (2025), pp. 58-71
Closed Access

Enhancing Reptile Search Algorithm Performance for the Knapsack Problem with Integration of Chaotic Map
José Barrera-García, Felipe Cisternas-Caneo, Broderick Crawford, et al.
Lecture notes in computer science (2024), pp. 70-81
Closed Access | Times Cited: 2

Binarization of Metaheuristics: Is the Transfer Function Really Important?
José Lemus-Romani, Broderick Crawford, Felipe Cisternas-Caneo, et al.
Biomimetics (2023) Vol. 8, Iss. 5, pp. 400-400
Open Access | Times Cited: 6

Intelligent decision-making for binary coverage: Unveiling the potential of the multi-armed bandit selector
Marcelo Becerra, José Lemus-Romani, Broderick Crawford, et al.
Expert Systems with Applications (2024) Vol. 251, pp. 124112-124112
Closed Access | Times Cited: 1

Chaotic Binary Fox Optimizer for Solving Set Covering Problem
Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto, et al.
Communications in computer and information science (2024), pp. 27-38
Closed Access | Times Cited: 1

Optimizing Retaining Walls through Reinforcement Learning Approaches and Metaheuristic Techniques
José Lemus-Romani, Diego Ossandón, Rocío Sepúlveda, et al.
Mathematics (2023) Vol. 11, Iss. 9, pp. 2104-2104
Open Access | Times Cited: 2

Page 1

Scroll to top