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
.