A polynomial algorithm for the multiple knapsack problem with divisible item sizes

Authors:
Paolo Detti
Affiliations:
Dipartimento di Ingegneria dell'Informazione, Università di Siena, Via Roma, 56, 53100 Siena, Italy
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 0

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
The Sequential Knapsack Polytope

SIAM Journal on Optimization
Solving sequential knapsack problems

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

A polynomial algorithm for the multiple bounded knapsack problem with divisible item sizes is presented. The complexity of the algorithm is O(n^2+nm), where n and m are the number of different item sizes and knapsacks, respectively. It is also shown that the algorithm complexity reduces to O(nlogn+nm) when a single copy exists of each item.