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.
No takes yet. Share an insight, caveat, or question.
Klamroth et al. (2000) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: