In this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behavior of an on …-line bin-packing algorithm under an approximation criterion called differential ratio. We are interested in two types of … difficulty of the problem and for the quality of the algorithm developed to solve it. In its off-line version, the bin-packing …

In this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behaviour of an on …-line bin-packing algorithm under an approximation criterion called differential ratio. We are interested in two types of … difficulty of the problem and for the quality of the algorithm developed to solve it. In its off-line version, the bin-packing …

We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one …-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is …

We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one …-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is …