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
Xiangjing Lai, Jin‐Kao Hao, Fred Glover, et al.
Information Sciences (2018) Vol. 436-437, pp. 282-301
Closed Access | Times Cited: 53
Showing 26-50 of 53 citing articles:
Adaptive memory programming for the dynamic bipartite drawing problem
Bo Peng, Donghao Liu, Zhipeng Lü, et al.
Information Sciences (2020) Vol. 517, pp. 183-197
Closed Access | Times Cited: 7
Bo Peng, Donghao Liu, Zhipeng Lü, et al.
Information Sciences (2020) Vol. 517, pp. 183-197
Closed Access | Times Cited: 7
A randomized heuristic repair for the multidimensional knapsack problem
Jean P. Martins, Bruno César Ribas
Optimization Letters (2020) Vol. 15, Iss. 2, pp. 337-355
Closed Access | Times Cited: 6
Jean P. Martins, Bruno César Ribas
Optimization Letters (2020) Vol. 15, Iss. 2, pp. 337-355
Closed Access | Times Cited: 6
Solving 0-1 Bi-Objective Multi-dimensional Knapsack Problems Using Binary Genetic Algorithm
Özgür Kabadurmuş, M. Fatih Taşgetiren, Hande Öztop, et al.
Studies in computational intelligence (2020), pp. 51-67
Closed Access | Times Cited: 5
Özgür Kabadurmuş, M. Fatih Taşgetiren, Hande Öztop, et al.
Studies in computational intelligence (2020), pp. 51-67
Closed Access | Times Cited: 5
A Diversification-based Quantum Particle Swarm Optimization Algorithm for the Multidimensional Knapsack Problem
Xiangjing Lai, Jin‐Kao Hao, Yue Dong, et al.
(2018), pp. 315-319
Closed Access | Times Cited: 4
Xiangjing Lai, Jin‐Kao Hao, Yue Dong, et al.
(2018), pp. 315-319
Closed Access | Times Cited: 4
Corrigendum to “Empirical Orthogonal Constraint Generation for Multidimensional 0/1 Knapsack Problems”
Thomas Setzer, Sebastian M. Blanc
European Journal of Operational Research (2020) Vol. 286, Iss. 2, pp. 791-795
Closed Access | Times Cited: 4
Thomas Setzer, Sebastian M. Blanc
European Journal of Operational Research (2020) Vol. 286, Iss. 2, pp. 791-795
Closed Access | Times Cited: 4
Hybrid Evolutionary Algorithm for the Overlap Constrained Resource Allocation Problem in Wireless Networks
Yi‐Ting Wang, Yawen Li, Zequn Wei, et al.
Lecture notes on data engineering and communications technologies (2024), pp. 245-256
Closed Access
Yi‐Ting Wang, Yawen Li, Zequn Wei, et al.
Lecture notes on data engineering and communications technologies (2024), pp. 245-256
Closed Access
A Solution-Based Tabu Search for Quadratic Knapsack Problem with Conflict Graphs
Zhenghao Xu, Xueshi Dong
(2024)
Closed Access
Zhenghao Xu, Xueshi Dong
(2024)
Closed Access
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
Qing Zhou, Jin‐Kao Hao, Zhong‐Zhong Jiang, et al.
International Transactions in Operational Research (2024)
Closed Access
Qing Zhou, Jin‐Kao Hao, Zhong‐Zhong Jiang, et al.
International Transactions in Operational Research (2024)
Closed Access
An Artificial Bee Colony Algorithm for the Multidimensional Knapsack Problem
Niusha Yaghini, Mir Yasin Seyed Valizadeh
International Journal of Applied Metaheuristic Computing (2024) Vol. 15, Iss. 1, pp. 1-23
Open Access
Niusha Yaghini, Mir Yasin Seyed Valizadeh
International Journal of Applied Metaheuristic Computing (2024) Vol. 15, Iss. 1, pp. 1-23
Open Access
Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem
Jianpeng Ding, Liuxin Chen, Ginger Y. Ke, et al.
International Transactions in Operational Research (2021) Vol. 29, Iss. 2, pp. 760-782
Closed Access | Times Cited: 4
Jianpeng Ding, Liuxin Chen, Ginger Y. Ke, et al.
International Transactions in Operational Research (2021) Vol. 29, Iss. 2, pp. 760-782
Closed Access | Times Cited: 4
Imperialist Competitive Algorithm with Independence and Constrained Assimilation
Ivars Dzalbs, Tatiana Kalganova, Ian Dear
2022 International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA) (2020)
Open Access | Times Cited: 3
Ivars Dzalbs, Tatiana Kalganova, Ian Dear
2022 International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA) (2020)
Open Access | Times Cited: 3
Negative Learning in Ant Colony Optimization: Application to the Multi Dimensional Knapsack Problem
Teddy Nurcahyadi, Christian Blum
(2021)
Closed Access | Times Cited: 3
Teddy Nurcahyadi, Christian Blum
(2021)
Closed Access | Times Cited: 3
Effective Methods for Constraint Handling in Quantum Inspired Evolutionary Algorithm for Multi-Dimensional 0–1 Knapsack Problem
Ayush Jindal, Sulabh Bansal
2021 5th International Conference on Information Systems and Computer Networks (ISCON) (2019), pp. 534-537
Closed Access | Times Cited: 2
Ayush Jindal, Sulabh Bansal
2021 5th International Conference on Information Systems and Computer Networks (ISCON) (2019), pp. 534-537
Closed Access | Times Cited: 2
Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem
Ivars Dzalbs, Tatiana Kalganova, Ian Dear
arXiv (Cornell University) (2020)
Open Access | Times Cited: 2
Ivars Dzalbs, Tatiana Kalganova, Ian Dear
arXiv (Cornell University) (2020)
Open Access | Times Cited: 2
Application of Pigeon Inspired Optimization for Multidimensional Knapsack Problem
Fran Setiawan, A. Sadiyoko, C. Setiardjo
International Journal of Industrial Engineering and Engineering Management (2020) Vol. 2, Iss. 1, pp. 45-56
Open Access | Times Cited: 2
Fran Setiawan, A. Sadiyoko, C. Setiardjo
International Journal of Industrial Engineering and Engineering Management (2020) Vol. 2, Iss. 1, pp. 45-56
Open Access | Times Cited: 2
Exploiting Local Optimality in Metaheuristic Search
Fred Glover
arXiv (Cornell University) (2020)
Open Access | Times Cited: 1
Fred Glover
arXiv (Cornell University) (2020)
Open Access | Times Cited: 1
A special 0-1 Knapsack problem for a small vegetable retailing system under fuzziness: a swarm optimization based approach
Samiran Acharyya, Chiranjit Changdar, Utpal Nandi
Neural Computing and Applications (2022) Vol. 34, Iss. 11, pp. 9175-9190
Closed Access | Times Cited: 1
Samiran Acharyya, Chiranjit Changdar, Utpal Nandi
Neural Computing and Applications (2022) Vol. 34, Iss. 11, pp. 9175-9190
Closed Access | Times Cited: 1
The Knapsack Problem and Its Variants: Formulations and Solution Methods
Christophe Wilbaut, Saïd Hanafi, Igor Machado Coelho, et al.
Springer eBooks (2022), pp. 105-151
Closed Access | Times Cited: 1
Christophe Wilbaut, Saïd Hanafi, Igor Machado Coelho, et al.
Springer eBooks (2022), pp. 105-151
Closed Access | Times Cited: 1
A Weighting-Based Tabu Search Algorithm for the p-Next Center Problem
Qingyun Zhang, Zhouxing Su, Zhipeng Lü, et al.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (2022), pp. 4828-4834
Open Access | Times Cited: 1
Qingyun Zhang, Zhouxing Su, Zhipeng Lü, et al.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (2022), pp. 4828-4834
Open Access | Times Cited: 1
An Adaptive Search Algorithm with Scatter and Tabu Strategy for Multidimensional Knapsack Problem
Song He, Wei Li
Communications in computer and information science (2022), pp. 327-344
Closed Access | Times Cited: 1
Song He, Wei Li
Communications in computer and information science (2022), pp. 327-344
Closed Access | Times Cited: 1
Combined algorithms for determining the initial solution of discrete optimization problems
B. І. Yukhimenko, N. H. Volkova, Yu. Yu. Kozina
INFORMATICS AND MATHEMATICAL METHODS IN SIMULATION (2023) Vol. 13, Iss. 1-2, pp. 162-172
Open Access
B. І. Yukhimenko, N. H. Volkova, Yu. Yu. Kozina
INFORMATICS AND MATHEMATICAL METHODS IN SIMULATION (2023) Vol. 13, Iss. 1-2, pp. 162-172
Open Access
Iterated two-phase local search for the Set-Union Knapsack Problem
Zequn Wei, Jin‐Kao Hao
arXiv (Cornell University) (2019)
Open Access
Zequn Wei, Jin‐Kao Hao
arXiv (Cornell University) (2019)
Open Access
Dual mean field annealing scheme for binary optimization under linear constraints
Arturo Berrones, Jonás Velasco, Juan Banda
Operations Research Letters (2020) Vol. 48, Iss. 3, pp. 271-277
Closed Access
Arturo Berrones, Jonás Velasco, Juan Banda
Operations Research Letters (2020) Vol. 48, Iss. 3, pp. 271-277
Closed Access
An Effective Hybrid Approach for Solving Prioritized Cube Selection Problem Using Particle Swarm Optimization and Tabu Search
Anjana Gosain, Heena Madaan
Advances in intelligent systems and computing (2020), pp. 347-359
Closed Access
Anjana Gosain, Heena Madaan
Advances in intelligent systems and computing (2020), pp. 347-359
Closed Access
Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem
Jitao Xu, Hongbo Li, Minghao Yin
arXiv (Cornell University) (2022)
Open Access
Jitao Xu, Hongbo Li, Minghao Yin
arXiv (Cornell University) (2022)
Open Access
