1. Csirik, J., Van Vliet, A.: An on-line algorithm for multidimensional bin packing. Oper. Res. Lett, (to appear).
2. Galambos, G.: A 1.6 lower bound for the two-dimensional on-line rectangle bin packing. Acta Cybernetica10, 21–24 (1991).
3. Galambos, G., Frenk, J. B. G.: A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case. Discr. Appl. Math.41, 173–178 (1993).
4. Galambos, G., Kellerer, H., Woeginger G.: A lower bound for on-line vector-packing algorithms. Report no. 182, Institute für Mathematik, Technische Universität Graz (1991).
5. Garey, M. R., Johnson, D. S.: Computers and intractability: a guide to the theory of NP-completeness. San Francisco: W. H. Freeman, 1979.