Skip to content
Back to outputs

The binary knapsack problem with qualitative levels

Research output: Contribution to journalArticle

Standard

The binary knapsack problem with qualitative levels. / Schäfer, Luca E.; Dietz, Tobias; Barbati, Maria; Figueira, José Rui; Greco, Salvatore; Ruzika, Stefan.

In: European Journal of Operational Research, 25.07.2020.

Research output: Contribution to journalArticle

Harvard

Schäfer, LE, Dietz, T, Barbati, M, Figueira, JR, Greco, S & Ruzika, S 2020, 'The binary knapsack problem with qualitative levels', European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2020.07.040

APA

Schäfer, L. E., Dietz, T., Barbati, M., Figueira, J. R., Greco, S., & Ruzika, S. (2020). The binary knapsack problem with qualitative levels. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2020.07.040

Vancouver

Schäfer LE, Dietz T, Barbati M, Figueira JR, Greco S, Ruzika S. The binary knapsack problem with qualitative levels. European Journal of Operational Research. 2020 Jul 25. https://doi.org/10.1016/j.ejor.2020.07.040

Author

Schäfer, Luca E. ; Dietz, Tobias ; Barbati, Maria ; Figueira, José Rui ; Greco, Salvatore ; Ruzika, Stefan. / The binary knapsack problem with qualitative levels. In: European Journal of Operational Research. 2020.

Bibtex

@article{2296eb90d20a47768b8b73ff18cae633,
title = "The binary knapsack problem with qualitative levels",
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.",
keywords = "Computing science, Knapsack problem, Non-dominance, Qualitative levels, Dynamic programming, embargoover12",
author = "Sch{\"a}fer, {Luca E.} and Tobias Dietz and Maria Barbati and Figueira, {Jos{\'e} Rui} and Salvatore Greco and Stefan Ruzika",
year = "2020",
month = jul,
day = "25",
doi = "10.1016/j.ejor.2020.07.040",
language = "English",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - The binary knapsack problem with qualitative levels

AU - Schäfer, Luca E.

AU - Dietz, Tobias

AU - Barbati, Maria

AU - Figueira, José Rui

AU - Greco, Salvatore

AU - Ruzika, Stefan

PY - 2020/7/25

Y1 - 2020/7/25

N2 - 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.

AB - 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.

KW - Computing science

KW - Knapsack problem

KW - Non-dominance

KW - Qualitative levels

KW - Dynamic programming

KW - embargoover12

U2 - 10.1016/j.ejor.2020.07.040

DO - 10.1016/j.ejor.2020.07.040

M3 - Article

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

ER -

ID: 21999526