.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Computing science
Knapsack problem
Non-dominance
Qualitative levels
Dynamic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
View more organizations