A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing

  G. Galambos

Abstract:

  Examining on-line algorithms for the two dimensional rectangle bin-packing problem, Coppersmith asked in [2] whether one can give a better lower bound for this type of algorithms than the Liang's bound which is 1.5364... . In this paper we present a bound of 1.6.

  Keywords: Two-dimensional bin-packing, worst-case analysis, on-line algorithms, heuristic.

 Gyenizse Pal 1996. Szeptember 4. Szerda 14:10:25 MET DST