.png){kind=icon}
返回
A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.10.045.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a heuristic to solve the 0-1 multi-constrained knapsack problem (01MKP) which is NP-hard. In this heuristic the dominance property of the constraints is exploited to reduce the search space to find near optimal solutions of 01MKP. This heuristic is tested for 10 benchmark problems of sizes up to 105 and for seven classical problems of sizes up to 500, taken from the literature and the results are compared with optimum solutions. Space and computational complexity of solving 01MKP using this approach are also presented. The encouraging results especially for relatively large size test problems indicate that this heuristic can successfully be used for finding good solutions for highly constrained NP-hard problems. (c) 2008 Elsevier Inc. All rights reserved.
Keyword:
0-1 multi-constrained knapsack problem
heuristic
computational complexity
NP-hard problems
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
Effect of calcination temperature on the properties of CZTS absorber layer prepared by RF sputtering for solar cell applications煅烧温度对射频溅射制备的CZTS吸收层性能的影响
OAAI
OAAI分享收藏
Patient personality and mortality: A 4-year prospective examination of chronic renal insufficiency.
PREAI
分享收藏
查看更多内容