1. Borgwardt K H (1987) “Probabilistic analysis of optimization algorithms — Some aspects from a practical point of view”, Acta Applicandae Mathematicae 10 (1987): 171–210.
2. Coffman E G, Jr., Fayolle G, Jacquet P & Robert P (1989) “Largest-first sequential selection with a sum constraint”, Report of AT & T Bell Laboratories, Murray Hill, New Jersey, 1989.
3. Coffman E G, Jr., Lueker G S & Rinnooy Kan A H G (1986) “An introduction to the probabilistic analysis of sequencing and packing heuristics”, Report 8602/A, Econometric Institute, Erasmus Universiteit Rotterdam, Rotterdam.
4. D'Atri G & Di Rende A (1980) “Probabilistic analysis of knapsack-type problems”, Methods of Operations Research 40 (1980): 279–282.
5. D'Atri G & Puech C (1982) “Probabilistic analysis of the subset-sum problem”, Discrete Applied Mathematics 4 (1982): 329–334.