• DOI:10.1007/978-1-4612-5791-2_22
Corpus ID: 122856639

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

@inproceedings{Lueker1982OnTA,
  title={On the Average Difference between the Solutions to Linear and Integer Knapsack Problems},
  author={G. S. Lueker},
  year={1982}
}

• G. S. Lueker
• Published 1982
• Mathematics

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

View via Publisher

escholarship.org

Save to Library

Create Alert

Cite

Launch Research Feed