.png){kind=icon}
返回
Multiple criteria dynamic programming and multiple knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.12.022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The aim of the paper is to show relations between two different types of optimization problems: multiple criteria dynamic programming (MCDP) and integer linear programming (ILP) in a form of multiple knapsack (MK) problem. Moreover, the paper presents how to use MCDP methods in order to solve (MK) problems. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
Multiple criteria programming
Dynamic programming
Integer programming
Knapsack problem
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容