Average-Case Analysis of Off-Line and On-Line Knapsack Problems

Journal of Algorithms

Volumn 29, Issue 2, 1998, Pages 277-305

  Lueker, George S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012834885     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0954     Document Type: Article

References (13)

1. E. Balas and E. Zemel, An algorithm for large zero-one knapsack problems, Oper. Res. 28(5) (1980), 1130-1154.
2. L. Devroye and T. Klincsek, Average time behavior of distributive sorting algorithms, Computing 26 (1981), 1-7.
3. A. V. Goldberg and A. Marchetti-Spaccamela, On finding the exact solution of a zero-one knapsack problem, in "Proceedings of the 16th Annual ACM Symposium on Theory of Computing," pp. 359-368, May 1984.
4. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58 (1963), 13-30.
5. E. Horowitz and S. Sahni, "Fundamentals of Computer Algorithms," Computer Science Press, Potomac, MD, 1978.
6. G. S. Lueker, Exponentially small bounds on the expected optimum of the partition and subset sum problems, Random Structures Algorithms 12 (1998), 51-62.
7. G. S. Lueker, On the average difference between the solutions to linear and integer knapsack problems, in "Applied Probability - Computer Science, The Interface" (R. L. Disney and T. J. Ott, Eds.), Vol. I, pp. 489-504, Birkhäuser, Boston, 1982.
8. A. Marchetti-Spaccamela and C. Vercellis, Stochastic on-line knapsack problems, Math. Programming 68(1) (1995), 73-104.
9. S. Martello and P. Toth, "Knapsack Problems: Algorithms and Computer Implementations," Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, Chichester, 1990.
10. C. McGeoch, Analyzing algorithms by simulation: Variance reduction techniques and simulation speedups, ACM Comput. Surv. 24(2) (1992), 195-212.
11. M. Meanti, A. Rinndoy Kan, L. Stougie, and C. Vercellis, A probabilistic analysis of the multiknapsack value function, Math. Programming 46 (1990), 237-247.
12. E. M. Reingold, personal communication.
13. S. van de Geer and L. Stougie, On rates of convergence and asymptotic normality in the multiknapsack problem, Math. Programming 51 (1991), 349-358.