Csirik, J.; Frenk, Frenk, J.B.G.; Labbé, Labbé, M. - Faculteit der Economische Wetenschappen, Erasmus … - 1993
The first algorithms for the on-line two-dimensional rectangle packing problem were introduced by Coppersmith and Raghavan. They showed that for a family of heuristics 13/4 is an upper bound for the asymptotic worst-case ratios. We have investigated the Next Fit and the First Fit variants of...