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 swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs
Isma Dahmani, Mhand Hifi, Toufik Saadi, et al.
Expert Systems with Applications (2020) Vol. 148, pp. 113224-113224
Open Access | Times Cited: 24

Showing 24 citing articles:

Performance assessment of the metaheuristic optimization algorithms: an exhaustive review
Abdul Halim, Idris Ismail, Swagatam Das
Artificial Intelligence Review (2020) Vol. 54, Iss. 3, pp. 2323-2409
Closed Access | Times Cited: 204
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
Valentina Cacchiani, Manuel Iori, Alberto Locatelli, et al.
Computers & Operations Research (2022) Vol. 143, pp. 105693-105693
Open Access | Times Cited: 98
A novel dynamic programming heuristic for the quadratic knapsack problem
M. Eliass Fennich, Franklin Djeumou Fomeni, Leandro C. Coelho
European Journal of Operational Research (2024) Vol. 319, Iss. 1, pp. 102-120
Open Access | Times Cited: 4
A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment
Mingjie Li, Jin‐Kao Hao, Qinghua Wu
European Journal of Operational Research (2023) Vol. 312, Iss. 2, pp. 473-492
Closed Access | Times Cited: 10
Kernel based tabu search for the Set-union Knapsack Problem
Zequn Wei, Jin‐Kao Hao
Expert Systems with Applications (2020) Vol. 165, pp. 113802-113802
Open Access | Times Cited: 26
A threshold search-based population algorithm for the sphere packing problem
Mhand Hifi, Amir Mohamed-Youssouf, Labib Yousef
Knowledge-Based Systems (2022) Vol. 261, pp. 110177-110177
Closed Access | Times Cited: 9
Multi-station test scheduling optimization method for industrial robot servo system
Shaomin Tang, Guixiong Liu, Zhiyu Lin, et al.
Journal of Ambient Intelligence and Humanized Computing (2020) Vol. 13, Iss. 3, pp. 1321-1337
Closed Access | Times Cited: 11
Set Theory-Based Operator Design in Evolutionary Algorithms for Solving Knapsack Problems
Ran Wang, Zichao Zhang
IEEE Transactions on Evolutionary Computation (2021) Vol. 25, Iss. 6, pp. 1133-1147
Closed Access | Times Cited: 10
Particle Swarm Optimisation Variants and Its Hybridisation Ratios for Generating Cost-Effective Educational Course Timetables
Thatchai Thepphakorn, Saisumpan Sooncharoen, Pupong Pongcharoen
SN Computer Science (2021) Vol. 2, Iss. 4
Open Access | Times Cited: 7
Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem
Isma Dahmani, Meriem Ferroum, Mhand Hifi
Cybernetics & Systems (2021) Vol. 53, Iss. 1, pp. 168-185
Closed Access | Times Cited: 6
An effective hybrid search method for the quadratic knapsack problem with conflict graphs
Qing Zhou, Jin‐Kao Hao, Zhong‐Zhong Jiang, et al.
Journal of the Operational Research Society (2023) Vol. 75, Iss. 5, pp. 1000-1010
Closed Access | Times Cited: 2
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
A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem
Isma Dahmani, Meriem Ferroum, Mhand Hifi, et al.
2022 8th International Conference on Control, Decision and Information Technologies (CoDIT) (2020), pp. 1162-1167
Closed Access | Times Cited: 4
A Solution-Based Tabu Search for Quadratic Knapsack Problem with Conflict Graphs
Zhenghao Xu, Xueshi Dong
(2024)
Closed Access
A reinforcement learning-driven cooperative scatter search for the knapsack problem with forfeits
Juntao Zhao, Mhand Hifi
Computers & Industrial Engineering (2024) Vol. 198, pp. 110713-110713
Closed Access
Branch Cut and Free Algorithm for the General Linear Integer Problem
Elias Munapo
Advances in intelligent systems and computing (2021), pp. 491-505
Closed Access | Times Cited: 4
Improvement of the branch and bound algorithm for solving the knapsack linear integer problem
Elias Munapo
Eastern-European Journal of Enterprise Technologies (2020) Vol. 2, Iss. 4 (104), pp. 59-69
Open Access | Times Cited: 3
Academic Operating Costs Optimisation Using Hybrid MCPSO Based Course Timetabling Tool
Thatchai Thepphakorn, Saisumpan Sooncharoen, Pupong Pongcharoen
Lecture notes in computer science (2020), pp. 338-350
Closed Access | Times Cited: 3
Solving 01 Knapsack Problem with variations of Flower Pollination Algorithm
Aboli Sundarkar, Amol C. Adamuthe
Journal of scientific research (2021) Vol. 65, Iss. 03, pp. 117-126
Open Access | Times Cited: 3
Automatic construction of accurate bioacoustics workflows under time constraints using a surrogate model
Alexander Brown, James Montgomery, Saurabh Garg
Applied Soft Computing (2021) Vol. 113, pp. 107944-107944
Open Access | Times Cited: 3
A Vulnerability Detection Approach for Automated Smart Contract Using Enhanced Machine Learning Techniques
Rexford Nii Ayitey Sosu, Jinfu Chen, William Leslie Brown‐Acquaye, et al.
Research Square (Research Square) (2022)
Open Access | Times Cited: 2
Expert habitat: a colonization conjecture for exoplanetary habitability via penalized multi-objective optimization-based candidate validation
Luckyson Khaidem, Snehanshu Saha, Saibal Kar, et al.
The European Physical Journal Special Topics (2021) Vol. 230, Iss. 10, pp. 2265-2283
Closed Access | Times Cited: 2
Reducing the complexity of the knapsack linear integer problem by reformulation techniques
Elias Munapo, Santosh Kumar
International Journal of Systems Assurance Engineering and Management (2021) Vol. 12, Iss. 6, pp. 1087-1093
Closed Access | Times Cited: 1
A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem
Mhand Hifi, A. Mohamed Youssouf, Toufik Saadi, et al.
2022 8th International Conference on Control, Decision and Information Technologies (CoDIT) (2020) Vol. 4729, pp. 1168-1173
Closed Access
Page 1

Scroll to top