On the Average Difference between the Solutions to Linear and Integer Knapsack Problems

  title={On the Average Difference between the Solutions to Linear and Integer Knapsack Problems},
  author={G. S. Lueker},
We analyze the expected difference between the solutions to the integer and linear versions of the 0–1 Knapsack Problem. This difference is of interest partly because it may help understand the efficiency of a well-known fast backtracking algorithm for the integer 0–1 Knapsack Problem. We show that, under a fairly reasonable input distribution, the expected difference is 0(log2n/n); for a somewhat more restricted subclass of input distribution, we also show that the expected difference is Ω(l/n… Expand
33 Citations
Stochastic on-line knapsack problems
  • 131
Probabilistic analysis of knapsack core algorithms
  • 22
  • Highly Influenced
  • PDF
Average-case analysis of off-line and on-line knapsack problems
  • 94
An experimental study of random knapsack problems
  • 11
  • PDF
On finding the exact solution of a zero-one knapsack problem
  • 46
An Experimental Study of Random Knapsack Problems
  • 4
A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem
  • 55
Greedy algorithms for the minimization knapsack problem: Average behavior
  • 6
Random knapsack in expected polynomial time
  • 21


Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
  • 933
Solving Large Zero-One Knapsack Problems.
  • 20
Probabilistic analysis of the subset-sum problem
  • 20
Covering the circle with random ARCS
  • 122
Big Omicron and big Omega and big Theta
  • 570
  • PDF
Computers and Intractability: A Guide to the Theory of NP-Completeness
  • 47,337
  • PDF
Cliques in random graphs
  • 298
  • PDF
Probabilistic Methods in Combinatorics
  • 535
  • PDF
An Information-Theoretic Method in Combinatorial Theory
  • N. Pippenger
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1977
  • 36