1. G. d'Atri, “Probabilistic analysis of the knapsack problem,” Technical Report No. 7, Groupe de Recherche 22, Centre National de la Recherche Scientifique (Paris, 1978).
2. G. Ausiello, A. Marchetti-Spaccamela and M. Protasi, “Probabilistic analysis of the solution of the knapsack problem,” in:Proceedings of the Tenth IFIP Conference (Springer, New York, 1982) pp. 557–565.
3. A.V. Fiacco and G.P. McCormick,Nonlinear Programming:Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968).
4. A.M. Frieze and M.R.B. Clarke, “Approximation algorithms for them-dimensional 0-1 knapsack problem: worst-case and probabilistic analysis,”European Journal of Operations Research 15 (1984) 100–109.
5. M.R. Garey and D.S. Johnson, “Strong NP-completeness results: motivation, examples and implications,”Journal of the Association of Computer Machinery 25 (1978) 499–508.