.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Multiple criteria programming
Dynamic programming
Integer programming
Knapsack problem
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more