• Pflug G, Ruszczyñski A and Schultz R. (1998). On the Glivenko-Cantelli Problem in Stochastic Programming. Mathematics of Operations Research. 23:1. (204-220). Online publication date: 1-Feb-1998.

    /doi/10.5555/2778229.2778239

  • Lueker G. Average-case analysis of off-line and on-line knapsack problems. Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms. (179-188).

    /doi/10.5555/313651.313692

  • Averbakh I. (1994). Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms. Mathematical Programming: Series A and B. 65:1-3. (311-330). Online publication date: 1-Feb-1994.

    https://doi.org/10.1007/BF01581700