Average-case analysis of a greedy algorithm for the 0/1 knapsack problem

Operations Research Letters

Volumn 31, Issue 3, 2003, Pages 202-210

  Calvin, James M ^a   Leung, Joseph Y T ^a  

^a University Heights   (United States)

Author keywords

0 1 Knapsack; Approximation algorithms; NP hard; Probabilistic analysis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBABILITY; SET THEORY;

KNAPSACK PROBLEM;

PROBLEM SOLVING;

EID: 0037402226     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00222-5     Document Type: Article

References (12)

1. Billingsley P. Convergence of Probability Measures. 1968;Wiley, New York.
2. Dyer M.E., Frieze A.M. Probabilistic analysis of the multidimensional knapsack problem. Math. Oper. Res. 14:1989;162-176.
3. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
4. van de Geer S., Stougie L. On rate of convergence and asymptotic normality in the multiknapsack problem. Math. Programming. 51:1993;349-358.
5. A.V. Goldberg, A. Marchetti-Spaccamela, On finding the exact solution of a zero-one knapsack problem, in: Proceedings of the XVI STOC, 1984, pp. 359-368.
6. Ibarra O.H., Kim C.E. Fast approximation algorithms for the knapsack and sum of subset problems. J. Assoc. Comput. Mach. 22:1975;463-468.
7. Karlin S., Taylor H. A First Course in Stochastic Processes. 2nd Edition:1975;Academic Press, San Diego.
8. G.S. Lueker, On the average difference between the solutions to linear and integer knapsack problems, in: R.L. Disey, T.J. Offa (Eds.), Applied Probability - Computer Science: The Interface, Vol. I, Birkhauser, Boston, 1982, pp. 489-504.
9. Lueker G.S. Average-case analysis of off-line and on-line knapsack problems. J. Algorithms. 29:1998;277-305.
10. A. Marchetti-Spaccamela, C. Vercellis, Efficient on-line algorithms for the knapsack problem, in: Proceedings of the XIV ICALP, Lecture Notes in Computer Science, Vol. 267, Springer, Berlin, 1987, pp. 445-456.
11. Meanti M., Rinnooy Kan A.H.G., Stougie L., Vercellis C. A probabilistic analysis of the multiknapsack value function. Math. Programming. 46:1990;237-247.
12. Sahni S. Approximate algorithms for the 0/1 knapsack problem. J. Assoc. Comput. Mach. 22:1975;115-124.