Computing Partitions with Applications to the Knapsack Problem

  title={Computing Partitions with Applications to the Knapsack Problem},
  author={E. Horowitz and S. Sahni},
  journal={J. ACM},
Given <italic>r</italic> numbers <italic>s</italic><subscrpt>1</subscrpt>, ···, <italic>s<subscrpt>r</subscrpt></italic>, algorithms are investigated for finding all possible combinations of these numbers which sum to <italic>M</italic>. This problem is a particular instance of the 0-1 unidimensional knapsack problem. All of the usual algorithms for this problem are investigated in terms of both asymptotic computing times and storage requirements, as well as average computing times. We develop… Expand
505 Citations
0 / 1-Knapsack vs . Subset Sum : A Comparison using AlgoLab
  • PDF
An exact algorithm for large multiple knapsack problems
  • 152
Exact approaches for the knapsack problem with setups
  • 12
  • PDF
A Minimal Algorithm for the 0-1 Knapsack Problem
  • 233
Algorithms for Some Hard Knapsack Problems
  • 6
  • PDF
Fast algorithms for knapsack via convolution and prediction
  • 10
  • PDF
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
  • 232
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
  • 933
An experimental study of random knapsack problems
  • 11
  • PDF


A Branch and Bound Algorithm for the Knapsack Problem
  • 178
  • Highly Influential
  • PDF