.png){kind=icon}
返回
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.03.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the 0/1 multi-dimensional knapsack problem and discuss the performances of a new heuristic procedure particularly suitable for a parallel computing environment embedding core problem approaches and a branching scheme based on reduced costs of the corresponding LP relaxation solution value. The proposed approach compared favorably to the recent state of the art procedures available in the literature on the well known OR-Library multi-dimensional knapsack problem benchmarks instances. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Multi-dimensional knapsack problem
Core problem
Partial enumeration
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Recovery of salinity gradient energy in desalination plants by reverse electrodialysis.png)
Desalination
OAAI
DesalinationIF0
OAAI分享收藏Alginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environmentsRSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容