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 two-phase tabu-evolutionary algorithm for the 0–1 multidimensional knapsack problem
Xiangjing Lai, Jin‐Kao Hao, Fred Glover, et al.
Information Sciences (2018) Vol. 436-437, pp. 282-301
Closed Access | Times Cited: 53

Showing 1-25 of 53 citing articles:

A binary moth search algorithm based on self-learning for multidimensional knapsack problems
Yanhong Feng, Gai‐Ge Wang
Future Generation Computer Systems (2021) Vol. 126, pp. 48-64
Closed Access | Times Cited: 49
Solution‐based versus attribute‐based tabu search for binary integer programming
Ketil Danielsen, Lars Magnus Hvattum
International Transactions in Operational Research (2025)
Closed Access
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
Xiangjing Lai, Jin‐Kao Hao, Dong Yue
European Journal of Operational Research (2018) Vol. 274, Iss. 1, pp. 35-48
Open Access | Times Cited: 48
Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem
Xiangjing Lai, Jin‐Kao Hao, Zhang-Hua Fu, et al.
Expert Systems with Applications (2020) Vol. 149, pp. 113310-113310
Open Access | Times Cited: 44
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
Raka Jovanović, Stefan Voß
OR Spectrum (2024) Vol. 46, Iss. 4, pp. 1329-1365
Open Access | Times Cited: 4
Iterated two-phase local search for the Set-Union Knapsack Problem
Zequn Wei, Jin‐Kao Hao
Future Generation Computer Systems (2019) Vol. 101, pp. 1005-1017
Open Access | Times Cited: 36
A lexicographic-based two-stage algorithm for vehicle routing problem with simultaneous pickup–delivery and time window
Yong Shi, Yanjie Zhou, Toufik Boudouh, et al.
Engineering Applications of Artificial Intelligence (2020) Vol. 95, pp. 103901-103901
Closed Access | Times Cited: 35
Multistart solution-based tabu search for the Set-Union Knapsack Problem
Zequn Wei, Jin‐Kao Hao
Applied Soft Computing (2021) Vol. 105, pp. 107260-107260
Open Access | Times Cited: 29
Adaptive feasible and infeasible tabu search for weighted vertex coloring
Wen Sun, Jin‐Kao Hao, Xiangjing Lai, et al.
Information Sciences (2018) Vol. 466, pp. 203-219
Closed Access | Times Cited: 37
A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem
José García, Paola Moraga, Matías A. Valenzuela, et al.
Mathematics (2020) Vol. 8, Iss. 4, pp. 507-507
Open Access | Times Cited: 26
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
Adding Negative Learning to Ant Colony Optimization: A Comprehensive Study
Teddy Nurcahyadi, Christian Blum
Mathematics (2021) Vol. 9, Iss. 4, pp. 361-361
Open Access | Times Cited: 20
Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems
Yanhong Feng, Hongmei Wang, Zhaoquan Cai, et al.
Mathematics (2023) Vol. 11, Iss. 8, pp. 1811-1811
Open Access | Times Cited: 8
Finding and exploring promising search space for The 0–1 Multidimensional Knapsack Problem
Jitao Xu, Hongbo Li, Minghao Yin
Applied Soft Computing (2024) Vol. 164, pp. 111934-111934
Open Access | Times Cited: 2
Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
Zequn Wei, Jin‐Kao Hao, Jintong Ren, et al.
European Journal of Operational Research (2023) Vol. 309, Iss. 3, pp. 993-1009
Open Access | Times Cited: 6
Iterative Local-Search Heuristic for Weighted Vehicle Routing Problem
Xinyu Wang, Shuai Shao, Jiafu Tang
IEEE Transactions on Intelligent Transportation Systems (2020) Vol. 22, Iss. 6, pp. 3444-3454
Open Access | Times Cited: 17
Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm
Bo Peng, Songge Wang, Donghao Liu, et al.
Expert Systems with Applications (2023) Vol. 237, pp. 121477-121477
Closed Access | Times Cited: 5
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
Solving maximum quasi-clique problem by a hybrid artificial bee colony approach
Bo Peng, Lifan Wu, Yang Wang, et al.
Information Sciences (2021) Vol. 578, pp. 214-235
Closed Access | Times Cited: 12
HSFL: An Efficient Split Federated Learning Framework via Hierarchical Organization
Tengxi Xia, Yongheng Deng, Sheng Yue, et al.
(2022), pp. 1-9
Closed Access | Times Cited: 8
A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem
Xiangjing Lai, Zhang-Hua Fu
IEEE Access (2019) Vol. 7, pp. 181357-181368
Open Access | Times Cited: 12
A comparative analysis of two matheuristics by means of merged local optima networks
Christian Blum, Gabriela Ochoa
European Journal of Operational Research (2020) Vol. 290, Iss. 1, pp. 36-56
Open Access | Times Cited: 12
A vertex weighting-based double-tabu search algorithm for the classical p-center problem
Qingyun Zhang, Zhipeng Lü, Zhouxing Su, et al.
Computers & Operations Research (2023) Vol. 160, pp. 106373-106373
Closed Access | Times Cited: 4
Adaptive elitist-ant system for solving combinatorial optimization problems
Anmar Abuhamdah
Applied Soft Computing (2021) Vol. 105, pp. 107293-107293
Closed Access | Times Cited: 10
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
Zequn Wei, Jin‐Kao Hao
Computers & Operations Research (2021) Vol. 136, pp. 105447-105447
Open Access | Times Cited: 9
Page 1 - Next Page

Scroll to top