An iterative rounding strategy-based algorithm for the set-union knapsack problem
Author:
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Link
https://link.springer.com/content/pdf/10.1007/s00500-021-06091-8.pdf
Reference26 articles.
1. Abdel-Basset M, El-Shahat D, El-Henawy I, Sangaiah AK (2018) A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making. Soft Computing 22:4221–4239
2. Al-Douri T, Hifi M, Zissimopoulos V (2019) An iterative algorithm for the max-min knapsack problem with multiple scenarios. Operational Research - An International Journal. https://doi.org/10.1007/s12351-019-00463-7
3. Arulselvan A (2014) A note on the set union knapsack problem. Discrete Applied Mathematics 169:214–218
4. Baykasoglu A, Ozsoydan FB, Senol ME (2020) Weighted superposition attraction algorithm for binary optimization problems. Operational Research 20:2555–2581
5. Bertsimas D, Demir R (2002) An approximate dynamic programming approach to multidimensional knapsack problems. Management Science 48(4), 550–565
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. CUDA-based parallel local search for the set-union knapsack problem;Knowledge-Based Systems;2024-09
2. An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem;Information Sciences;2024-08
3. A Hybrid Machine Learning Method for Solving the Set Union Knapsack Problem;Lecture Notes in Networks and Systems;2024
4. The Local Branching as a Learning Strategy in the Evolutionary Algorithm: The Case of the Set-Union Knapsack Problem;Journal of Advances in Information Technology;2022
5. Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem;Cybernetics and Systems;2021-12-01
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3