Dynamic programming approaches to the multiple criteria knapsack problem

Citation
K. Klamroth et Mm. Wiecek, Dynamic programming approaches to the multiple criteria knapsack problem, NAV RES LOG, 47(1), 2000, pp. 57-76
Citations number
32
Categorie Soggetti
Civil Engineering
Journal title
NAVAL RESEARCH LOGISTICS
ISSN journal
0894069X → ACNP
Volume
47
Issue
1
Year of publication
2000
Pages
57 - 76
Database
ISI
SICI code
0894-069X(200002)47:1<57:DPATTM>2.0.ZU;2-4
Abstract
We study the integer multiple criteria knapsack problem and propose dynamic -programming-based approaches to finding all the nondominated solutions. Di fferent and more complex models are discussed, including the binary multipl e criteria knapsack problem, problems with more than one constraint, and mu ltiperiod as well as time-dependent models. (C) 2000 John Wiley & Sons, Inc .