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:

Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem
Mingchang Chih
Applied Soft Computing (2014) Vol. 26, pp. 378-389
Closed Access | Times Cited: 85

Showing 1-25 of 85 citing articles:

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
Self-adaptive parameter and strategy based particle swarm optimization for large-scale feature selection problems with multiple classifiers
Yu Xue, Tao Tang, Wei Pang, et al.
Applied Soft Computing (2019) Vol. 88, pp. 106031-106031
Open Access | Times Cited: 140
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
An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem
Tao Meng, Quan-Ke Pan
Applied Soft Computing (2016) Vol. 50, pp. 79-93
Closed Access | Times Cited: 95
A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem
Mohamed Abdel‐Basset, Syed Bilal Hussain Shah, Arun Kumar Sangaiah
International Journal of Machine Learning and Cybernetics (2017) Vol. 10, Iss. 3, pp. 495-514
Closed Access | Times Cited: 94
Joint optimization of data placement and scheduling for improving user experience in edge computing
Chunlin Li, Jingpan Bai, Jianhang Tang
Journal of Parallel and Distributed Computing (2018) Vol. 125, pp. 93-105
Closed Access | Times Cited: 92
DTCSMO: An efficient hybrid starling murmuration optimizer for engineering applications
Gang Hu, Jingyu Zhong, Guo Wei, et al.
Computer Methods in Applied Mechanics and Engineering (2023) Vol. 405, pp. 115878-115878
Closed Access | Times Cited: 36
A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem
Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, et al.
Engineering Applications of Artificial Intelligence (2016) Vol. 55, pp. 1-13
Closed Access | Times Cited: 84
Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems
Djaafar Zouache, Farid Nouioua, Abdelouahab Moussaoui
Soft Computing (2015) Vol. 20, Iss. 7, pp. 2781-2799
Closed Access | Times Cited: 83
Binary artificial algae algorithm for multidimensional knapsack problems
Xuedong Zhang, Changzhi Wu, Jing Li, et al.
Applied Soft Computing (2016) Vol. 43, pp. 583-595
Closed Access | Times Cited: 81
Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem
Yanhong Feng, Gai‐Ge Wang, Wenbin Li, et al.
Neural Computing and Applications (2017) Vol. 30, Iss. 10, pp. 3019-3036
Closed Access | Times Cited: 81
A k-means binarization framework applied to multidimensional knapsack problem
José García, Broderick Crawford, Ricardo Soto, et al.
Applied Intelligence (2017) Vol. 48, Iss. 2, pp. 357-380
Closed Access | Times Cited: 79
A human learning optimization algorithm and its application to multi-dimensional knapsack problems
Ling Wang, Ruixin Yang, Haoqi Ni, et al.
Applied Soft Computing (2015) Vol. 34, pp. 736-743
Closed Access | Times Cited: 78
Stochastic stability analysis of particle swarm optimization with pseudo random number assignment strategy
Mingchang Chih
European Journal of Operational Research (2022) Vol. 305, Iss. 2, pp. 562-593
Closed Access | Times Cited: 35
Discrete particle swarm optimization approach for cost sensitive attribute reduction
Jianhua Dai, Huifeng Han, Qinghua Hu, et al.
Knowledge-Based Systems (2016) Vol. 102, pp. 116-126
Closed Access | Times Cited: 56
A Binary differential search algorithm for the 0–1 multidimensional knapsack problem
Jianjun Liu, Changzhi Wu, Jiang Cao, et al.
Applied Mathematical Modelling (2016) Vol. 40, Iss. 23-24, pp. 9788-9805
Open Access | Times Cited: 56
Improved global-best-guided particle swarm optimization with learning operation for global optimization problems
Haibin Ouyang, Liqun Gao, Steven Li, et al.
Applied Soft Computing (2016) Vol. 52, pp. 987-1008
Closed Access | Times Cited: 53
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
A priority-induced demand side management system to mitigate rebound peaks using multiple knapsack
Asif Khan, Nadeem Javaid, Adnan Ahmad, et al.
Journal of Ambient Intelligence and Humanized Computing (2018) Vol. 10, Iss. 4, pp. 1655-1678
Closed Access | Times Cited: 50
An Effective Cuckoo Search Algorithm for Node Localization in Wireless Sensor Network
Jing Cheng, Linyuan Xia
Sensors (2016) Vol. 16, Iss. 9, pp. 1390-1390
Open Access | Times Cited: 49
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
An adaptive binary quantum-behaved particle swarm optimization algorithm for the multidimensional knapsack problem
Xiaotong Li, Wei Fang, Shuwei Zhu, et al.
Swarm and Evolutionary Computation (2024) Vol. 86, pp. 101494-101494
Closed Access | Times Cited: 4
Exact and approximate algorithms for discounted {0-1} knapsack problem
Yichao He, Xizhao Wang, Yulin He, et al.
Information Sciences (2016) Vol. 369, pp. 634-647
Closed Access | Times Cited: 42
A Particle Swarm Optimization-Based Heuristic for Software Module Clustering Problem
Amarjeet Prajapati, Jitender Kumar Chhabra
Arabian Journal for Science and Engineering (2017) Vol. 43, Iss. 12, pp. 7083-7094
Closed Access | Times Cited: 40
A binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems
Mohamed Abdel‐Basset, Syed Bilal Hussain Shah, Hossam Faris, et al.
Computers & Industrial Engineering (2019) Vol. 132, pp. 187-206
Open Access | Times Cited: 40
Page 1 - Next Page

Scroll to top