On finding the exact solution of a zero-one knapsack problem

@inproceedings{Goldberg1984OnFT,
  title={On finding the exact solution of a zero-one knapsack problem},
  author={A. Goldberg and A. Marchetti-Spaccamela},
  booktitle={STOC '84},
  year={1984}
}
Given a 0-1 knapsack problem with input drawn from a certain probability distribution, we show that for every ε > 0, there is a self-checking polynomial-time algorithm that finds an optimal solution with probability at least 1 -ε. We also prove some upper and lower bounds on random variables related to the problem. 
46 Citations
A probabilistic analysis of the multiknapsack value function
  • 18
  • PDF
Stochastic on-line knapsack problems
  • 131
Random knapsack in expected polynomial time
  • 21
Random knapsack in expected polynomial time
  • 118
  • PDF
An Experimental Study of Random Knapsack Problems
  • 4
  • Highly Influenced
Probabilistic Analysis of the Multidimensional Knapsack Problem
  • 36
  • Highly Influenced
Probabilistic analysis of knapsack core algorithms
  • 22
  • Highly Influenced
  • PDF
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
  • 13
  • PDF
An experimental study of random knapsack problems
  • 11
  • PDF
...
1
2
3
4
5
...