.png){kind=icon}
返回
Dynamic programming based algorithms for the discounted {0-1} knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2011.12.068.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The discounted {0-1} knapsack problem (DKP) is an extension of the classical {0-1} knapsack problem (KP) that consists of selecting a set of item groups where each group includes three items and at most one of the three items can be selected. The DKP is more challenging than the KP because four choices of items in an item group diversify the selection of the items. Consequently, it is not possible to solve the DKP based on a classical definition of a core consisting of a small number of relevant variables. This paper partitions the DKP into several easier sub-problems to achieve problem reductions by imitating the core concept of the KP to derive an alternative core for the DKP. Numerical experiments with DP-based algorithms are conducted to evaluate the effectiveness of the problem partition by solving the partitioned problem and the original problem based on different types of DKP instances. (C) 2011 Elsevier Inc. All rights reserved.
Keyword:
Discounted knapsack problem
Dynamic programming
Problem partition
Core concept
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容