Premium
Dynamic programming approaches to the multiple criteria knapsack problem
Author(s) -
Klamroth Kathrin,
Wiecek Margaret M.
Publication year - 2000
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(200002)47:1<57::aid-nav4>3.0.co;2-4
Subject(s) - knapsack problem , change making problem , continuous knapsack problem , mathematical optimization , cutting stock problem , dynamic programming , integer programming , constraint (computer aided design) , computer science , generalized assignment problem , binary number , mathematics , operations research , optimization problem , geometry , arithmetic
We study the integer multiple criteria knapsack problem and propose dynamic‐programming‐based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and multiperiod as well as time‐dependent models. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 57–76, 2000