Dynamic programming approaches to the multiple criteria knapsack problem

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