Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
The {0,1}-knapsack problem with qualitative levels
Luca E. Schäfer, Tobias Dietz, Maria Barbati +3
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 f…
cs.DS2018
Shortest Paths with Ordinal Weights
Luca E. Schäfer, Tobias Dietz, Nicolas Fröhlich +2
We investigate the single-source-single-destination "shortest" paths problem in acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and effi…