Login / Signup

A PTAS for the Multiple Subset Sum Problem with different knapsack capacities.

Alberto CapraraHans KellererUlrich Pferschy
Published in: Inf. Process. Lett. (2000)
Keyphrases
  • knapsack problem
  • database
  • np hard
  • dynamic programming
  • neural network
  • artificial intelligence
  • image processing
  • optimal solution
  • special case
  • upper bound
  • tabu search
  • feasible solution
  • approximation algorithms