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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.