1. G.d'Atri, “Outline of probabilistic framework for combinatorial optimization,”Numerical Techniques for Stochastic Systems (North-Holland, Amsterdam, 1980) 347–368.
2. G. d'Atri and C. Puech, “Probabilistic analysis of the subset—sum problem,”Discrete Applied Mathematics 4 (1982) 329–334.
3. G. Ausiello, A. Marchetti-Spaccamela and M. Protasi, “Probabilistic analysis of the solution of the knapsack problem,”Proceedings of the Tenth IFIP Conference (Springer, New York, 1982) 557–565.
4. I. Averbakh, “An algorithm for solvingm-dimensional knapsack problem with random coefficients,”Discretnaya Matematika 2 (1990) N3, 3–9 (in Russian).
5. I. Averbakh, “On the Lagrange function saddle points of them-dimensional knapsack problem”,Doklady Akademii Nauk SSSR (Soviet Math. Dokl.) 310 (1990) N2, 265–267.