A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Random knapsack in expected polynomial time

2003
*
Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03
*

In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove, for various input distributions, that the number of dominating solutions (i.e., Paretooptimal knapsack fillings) to this problem is polynomially bounded in the number of available items. An algorithm by Nemhauser and Ullmann can enumerate these solutions very efficiently so that a polynomial upper bound on the number

doi:10.1145/780542.780578
dblp:conf/stoc/BeierV03
fatcat:mbenivbon5bbhm64yt23ya2rdq