An Experimental Study of Random Knapsack Problems

The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimentally investigate the number of Pareto optimal knapsack fillings. Our experiments suggests that the theoretically proven upper bound of O(n3) for uniform instances and O(φµn4) for general probability distributions is not tight. Instead we conjecture an upper bound of O(φµn2) matching a lower bound for adversarial weights. In the second part we study advanced algorithmic techniques for the knapsack problem. We combine several ideas that have been used in theoretical studies to bound the average-case complexity of the knapsack problem. The concepts used are simple and have been known since at least 20 years, but apparently have not been used together. The result is a very competitive code that outperforms the best known implementation Combo by orders of magnitude also for harder random knapsack instances.

• Type: Conference
• Year: 2004
• Where: ESA
• Authors: René Beier, Berthold Vöcking
• Keywords: ESA 2004, Knapsack Problem, Pareto Optimal Knapsack, Upper Bound