| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4628367 | Applied Mathematics and Computation | 2014 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Sebastian Sitarz,