Dynamic programming approaches to the multiple criteria knapsack problem

Kathrin Klamroth and Margaret M. Wiecek

Naval Research Logistics (NRL), 2000, vol. 47, issue 1, 57-76

Abstract: 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

Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(200002)47:13.0.CO;2-4

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:47:y:2000:i:1:p:57-76

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().