.png){kind=icon}
返回
The binary knapsack problem with qualitative levels
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2020.07.040.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the feasible subsets of the given item set and show that this relation defines a preorder. We propose a dynamic programming algorithm to compute the entire set of non-dominated rank cardinality vectors and we state two greedy algorithms, which efficiently compute a single efficient solution. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Computing science
Knapsack problem
Non-dominance
Qualitative levels
Dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
分享收藏A fuzzy weighted average approach for selecting portfolio of new product development projects.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem基于协同局部搜索的多场景最大最小背包问题算法OAAI
OAAI分享收藏
查看更多内容