The binary knapsack problem with qualitative levels

Luca E. Schäfer,Tobias Dietz,Maria Barbati,José Rui Figueira,Salvatore Greco,Stefan Ruzika

European Journal of Operational Research（2021）

引用 7|浏览24

暂无评分

摘要

•We define a dominance relation for item sets with qualitative levels.•Two greedy algorithms efficiently computing an efficient solution are proposed.•A dynamic programming algorithm computing all efficient solutions is presented.

查看译文

关键词

Computing science,Knapsack problem,Non-dominance,Qualitative levels,Dynamic programming

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要