A well‐solvable special case of the bounded knapsack problem

A well‐solvable special case of the bounded knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor20133242
Volume: 39
Issue: 2
Start Page Number: 118
End Page Number: 120
Publication Date: Mar 2011
Journal: Operations Research Letters
Authors: ,
Keywords: knapsack problem
Abstract:

We identify a polynomially solvable special case of the bounded knapsack problem that is characterized by a set of simple inequalities relating item weight ratios to item profit ratios. Our result generalizes and extends a corresponding result of Zukerman, et al. (2001) for the unbounded knapsack problem.

Reviews

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