1. J. L. Bentley, D. S. Johnson, F. T. Leighton, and C. C. McGeoch, An experimental study of bin packing,Proc. 21st Ann. Allerton Conf. on Communication, Control, and Computing, University of Illinois, Urbana, Ill, pp. 51–60, 1983.
2. J. L. Bentley, D. S. Johnson, F. T. Leighton, C. C. McGeoch, and L. A. McGeoch, Some Unexpected Expected Behavior Results for Bin Packing,Proc 16th Ann. Symp. on Theory of Computing, pp. 279–288, 1984.
3. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, Approximation Algorithms for Bin-Packing—An Updated Survey, inAlgorithm Design for Computer System Design, G. Ausiello, M. Lucertini, and P. Serafini (eds.), Springer-Verlag, New York, pp. 49–106, 1984.
4. E. G. Coffman, Jr., G. S. Lueker, and A. H. G. Rinnooy Kan, Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics,Management Science,35, p. 266, 1988.
5. H. T. Davis,Tables of the Mathematical Functions, Principia Press of Trinity University, Vol. I, pp. 333, 336, Vol. II, pp. 34, 1935.