In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is "rotatable" by 90 degrees. An on-line algorithm that uses an unbounded number of active bins is proposed. The worst case ratio of the algorithm is at least 2.25 and at most 2.565.
CITATION STYLE
Fujita, S., & Hada, T. (2000). Two-dimensional on-line bin packing problem with rotatable items. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1858, pp. 210–220). Springer Verlag. https://doi.org/10.1007/3-540-44968-x_21
Mendeley helps you to discover research relevant for your work.