.png){kind=icon}
返回
Computational experience with a core-based reduction procedure for the 2-knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2010.07.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this note we consider the 2-knapsack problem where each item has both a weight and a size. We show that a simple yet powerful reduction procedure can significantly enhance the capabilities of a commercial ILP solver, leading to solve very large instances. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Two-constraint knapsack
Reduction procedure
Core problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Alginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environments.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏
分享收藏