.png){kind=icon}
返回
Solving efficiently the 0-1 multi-objective knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2007.09.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present an approach, based on dynamic programming, for solving the 0-1 multi-objective knapsack problem. The main idea of the approach relies on the use of several complementary dominance relations to discard partial solutions that cannot lead to new non-dominated criterion vectors. This way, we obtain an efficient method that outperforms the existing methods both in terms of CPU time and size of solved instances. Extensive numerical experiments on various types of instances are reported. A comparison with other exact methods is also performed. In addition, for the first time to our knowledge, we present experiments in the three-objective case. (C) 2007 Elsevier Ltd. All rights reserved.
Keyword:
Multi-objective knapsack problem
Non-dominated criterion vectors
Efficient solutions
Dynamic programming
Dominance relations
Combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Integrating partial optimization with scatter search for solving bi-criteria {0,1}-knapsack problems
PREAI
分享收藏分享收藏
查看更多内容