Textes imprimés
We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of items a1, a2, . . . , an and a sequence of their sizes (s1, s2, . . . , sn) (each size si ∈ (0, 1]) and are required to pack the items into a minimum number of unit-capacity bins. Let R1{ , } be the minimal asymptot...
