A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Author:
Affiliation:
1. OPTIT Srl, 40026 Imola (BO), Italy
2. Department of Electrical, Electronic, and Information Engineering “Guglielmo Marconi,” Università di Bologna, 40136 Bologna, Italy
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
General Engineering
Link
https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.2016.0742
Reference20 articles.
1. Local branching-based algorithms for the disjunctively constrained knapsack problem
2. An exact algorithm for the maximum clique problem
3. Benchmarking optimization software with performance profiles
4. A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
5. A hybrid grouping genetic algorithm for bin packing
Cited by 38 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Solving a 3D bin packing problem with stacking constraints;Computers & Industrial Engineering;2024-02
2. A new binary coati optimization algorithm for binary optimization problems;Neural Computing and Applications;2023-11-24
3. Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items;Computers & Operations Research;2023-10
4. Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut;Computers & Industrial Engineering;2023-10
5. Responsive strategic oscillation for solving the disjunctively constrained knapsack problem;European Journal of Operational Research;2023-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3