A well-solvable special case of the bounded knapsack problem

Authors:
Vladimir G. Deineko;Gerhard J. Woeginger
Affiliations:
Warwick Business School, The University of Warwick, Coventry CV4 7AL, United Kingdom;Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, Netherlands
Venue:
Operations Research Letters
Year:
2011

Citing 4
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation

Discrete Applied Mathematics
A polynomial-time algorithm for knapsack with divisible item sizes

Information Processing Letters
A polynomially solvable special case of the unbounded knapsack problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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. [M. Zukerman, L. Jia, T. Neame, G.J. Woeginger, A polynomially solvable special case of the unbounded knapsack problem, Operations Research Letters 29 (2001) 13-16] for the unbounded knapsack problem.