Dynamic programming approaches to the multiple criteria knapsack problem

Dynamic programming approaches to the multiple criteria knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor20003022
Country: United States
Volume: 47
Issue: 1
Start Page Number: 57
End Page Number: 76
Publication Date: Feb 2000
Journal: Naval Research Logistics
Authors: ,
Keywords: programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.