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:

A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem
M. Fatih Tasgetiren, Quan-Ke Pan, Damla Kızılay, et al.
2022 IEEE Congress on Evolutionary Computation (CEC) (2015), pp. 2797-2804
Closed Access | Times Cited: 22

Showing 22 citing articles:

Recent advances in differential evolution – An updated survey
Swagatam Das, Sankha Subhra Mullick, Ponnuthurai Nagaratnam Suganthan
Swarm and Evolutionary Computation (2016) Vol. 27, pp. 1-30
Closed Access | Times Cited: 1442
A New Binary Particle Swarm Optimization Approach: Momentum and Dynamic Balance Between Exploration and Exploitation
Bach Hoai Nguyen, Bing Xue, Peter Andreae, et al.
IEEE Transactions on Cybernetics (2019) Vol. 51, Iss. 2, pp. 589-603
Closed Access | Times Cited: 98
The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches
Soukaina Laabadi, Mohamed Naïmi, Hassan El Amri, et al.
American Journal of Operations Research (2018) Vol. 08, Iss. 05, pp. 395-439
Open Access | Times Cited: 33
The impact of the optimal buffer configuration on production line efficiency: A VNS-based solution approach
Leyla Demir, Mehmet Ulaş Koyuncuoğlu
Expert Systems with Applications (2021) Vol. 172, pp. 114631-114631
Closed Access | Times Cited: 16
An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem
Karam M. Sallam, Amr A. Abohany, Rizk M. Rizk‐Allah
Neural Computing and Applications (2023) Vol. 35, Iss. 18, pp. 13359-13386
Closed Access | Times Cited: 6
A Pareto evolutionary algorithm based on incremental learning for a kind of multi-objective multidimensional knapsack problem
Rong-juan Luo, Wang Jia, Baolin Zhu
Computers & Industrial Engineering (2019) Vol. 135, pp. 537-559
Closed Access | Times Cited: 16
Adaptation of Binary Pigeon-Inspired Algorithm for Solving Multidimensional Knapsack Problem
Asaju La’aro Bolaji, Balogun Sulaiman Babatunde, Peter Bamidele Shola
Advances in intelligent systems and computing (2017), pp. 743-751
Closed Access | Times Cited: 13
A Modified Binary Pigeon-Inspired Algorithm for Solving the Multi-dimensional Knapsack Problem
Asaju La’aro Bolaji, Friday Zinzendoff Okwonu, Peter Bamidele Shola, et al.
Journal of Intelligent Systems (2020) Vol. 30, Iss. 1, pp. 90-103
Open Access | Times Cited: 12
A hybrid genetic algorithm for solving 0/1 Knapsack Problem
Soukaina Laabadi, Mohamed Naïmi, Hassan El Amri, et al.
(2018)
Closed Access | Times Cited: 10
A Hybrid Mutation Scheme-Based Discrete Differential Evolution Algorithm for Multidimensional Knapsack Problem
Libao Deng, Sha Wang, Jin Chengyu, et al.
(2016), pp. 1009-1014
Closed Access | Times Cited: 8
Hybrid Differential Evolution-Variable Neighborhood Search to Solve Multiobjective Hybrid Flowshop Scheduling with Job-Sequence Dependent Setup Time
Budi Santosa, Ong Andre Wahyu Riyanto
Lecture notes in computer science (2016), pp. 587-598
Closed Access | Times Cited: 7
D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem
Thiago Fialho de Queiroz Lafetá, Luiz G. A. Martins, Gina M. B. Oliveira
The Knowledge Engineering Review (2024) Vol. 39
Closed Access
An Intelligent Algorithm for AGV Scheduling in Intelligent Warehouses
Xuewen Wu, Minxia Zhang, Yu‐Jun Zheng
Lecture notes in computer science (2021), pp. 163-173
Closed Access | Times Cited: 4
Evolutionary Computation for Feature Selection in Classification
Bach Hoai Nguyen
(2018)
Open Access | Times Cited: 3
Variable Neighborhoods Search for Multi-Site Production Planning
Agung Mustika Rizki, Gusti Eka Yuliastuti, Wayan Firdaus Mahmudy, et al.
Journal of Information Technology and Computer Science (2018) Vol. 3, Iss. 2, pp. 169-174
Open Access | Times Cited: 2
A Differential Evolution Approach for the Reliability Constrained Unit Commitment Problem
Vasilios Tsalavoutis, Constantinos Vrionis, Athanasios Tolis, et al.
2021 IEEE Symposium Series on Computational Intelligence (SSCI) (2018), pp. 2329-2339
Closed Access | Times Cited: 2
A hybrid multi-objective evolutionary algorithm for economic-environmental generation scheduling
Vasilios Tsalavoutis, Constantinos Vrionis, Athanasios Tolis
Proceedings of the Genetic and Evolutionary Computation Conference (2019), pp. 1338-1346
Closed Access | Times Cited: 2
DE with A new population initialization method for the dynamic multidimensional knapsack problems
Qi Qiu, Junyi He, Tao Zhu
(2022), pp. 415-421
Closed Access | Times Cited: 1
Practical Population Initialization with Weighted Sample Recombination for Multidimensional Knapsack Problems
Qi Qiu, Tao Zhu, Wenjian Luo, et al.
(2023)
Closed Access
Evolutionary Computation for Feature Selection in Classification
Nguyễn Hoài Nam
(2018)
Open Access
Variable neighborhood search for the discounted {0-1} knapsack problem
Christophe Wilbaut, Raca Todosijević, Saïd Hanafi, et al.
Applied Soft Computing (2022) Vol. 131, pp. 109821-109821
Open Access
Heuristic and exact fixation-based approaches for the discounted 0-1 knapsack problem
Christophe Wilbaut, Raca Todosijević, S. Hanafi, et al.
arXiv (Cornell University) (2021)
Open Access
Page 1

Scroll to top