1. Bentley JL, Johnson DS, Leighton FT, McGeoch CC (1983) An experimental study of bin packing. In: Proceedings of the 21st annual Allerton conference on communication, control, and computing, Urbana, University of Illinois, 1983, pp 51–60
2. Bentley JL, Johnson DS, Leighton FT, McGeoch CC, McGeoch LA (1984) Some unexpected expected behavior results for bin packing. In: Proceedings of the 16th annual ACM symposium on theory of computing. ACM, New York, pp 279–288
3. Coffman EG Jr, Courcoubetis C, Garey MR, Johnson DS, McGeoch LA, Shor PW, Weber RR, Yannakakis M (1991) Fundamental discrepancies between average-case analyses under discrete and continuous distributions. In: Proceedings of the 23rd annual ACM symposium on theory of computing, New York, 1991. ACM Press, New York,pp 230–240
4. Coffman EG Jr, Garey MR, Johnson DS (1997) Approximation algorithms for bin-packing: a survey. In: Hochbaum D (ed) Approximation algorithms for NP-hard problems. PWS Publishing, Boston, pp 46–93
5. Coffman EG Jr, Johnson DS, Shor PW, Weber RR (1997) Bin packing with discrete item sizes, part II: tight bounds on first fit. Random Struct Algorithms 10:69–101