Paper Info
Title
A polynomial algorithm for the multiple knapsack problem with divisible item sizes
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.
Year
DOI
Venue
2009
10.1016/j.ipl.2009.02.003
Inf. Process. Lett.
Keywords
Field
DocType
algorithm complexity,single copy,different item size,multiple knapsack problem,multiple bounded knapsack problem,divisible item size,polynomial algorithm,analysis of algorithms,knapsack problem
Discrete mathematics,Combinatorics,Algorithm complexity,Polynomial,Analysis of algorithms,Continuous knapsack problem,Knapsack problem,Polynomial algorithm,Mathematics,Bounded function
Journal
Volume
Issue
ISSN
109
11
0020-0190
Citations 
PageRank 
References 
3
0.47
5
Authors
1
Name
Order
Citations
PageRank
Paolo Detti114419.55