Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- 1 September 1994
- journal article
- Published by Springer Nature in Computing
- Vol. 52 (3) , 281-297
- https://doi.org/10.1007/bf02246509
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An on-line algorithm for multidimensional bin packingOperations Research Letters, 1993
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric caseDiscrete Applied Mathematics, 1993
- An improved lower bound for on-line bin packing algorithmsInformation Processing Letters, 1992
- A lower bound for on-line bin packingInformation Processing Letters, 1980