A polynomial algorithm for the multiple knapsack problem with divisible item sizes.
Paolo DettiPublished in: Inf. Process. Lett. (2009)
Keyphrases
- knapsack problem
- optimal solution
- dynamic programming
- test problems
- np hard
- exact algorithms
- optimization problems
- objective function
- computational complexity
- learning algorithm
- worst case
- special case
- linear programming
- particle swarm optimization
- optimization algorithm
- search space
- benchmark problems
- cost function
- vehicle routing problem