The {0,1}-knapsack problem with qualitative levels
Data Structures and Algorithms
2020-02-13 v1 Artificial Intelligence
Combinatorics
Abstract
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.
Cite
@article{arxiv.2002.04850,
title = {The {0,1}-knapsack problem with qualitative levels},
author = {Luca E. Schäfer and Tobias Dietz and Maria Barbati and José Rui Figueira and Salvatore Greco and Stefan Ruzika},
journal= {arXiv preprint arXiv:2002.04850},
year = {2020}
}