Two-dimensional on-line bin packing problem with rotatable items.

DOI10.1016/S0304-3975(01)00410-8zbMath1061.68057MaRDI QIDQ1853573

Satoshi Fujita, Takeshi Hada

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

On-line algorithmRotation of itemsTwo-dimensional bin packing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (5)

Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Online bin packing of squares and cubes ⋮ Online bin packing of squares and cubes ⋮ Two-dimensional online bin packing with rotation ⋮ A lower bound for online rectangle packing

Cites Work

• Unnamed Item
• An on-line algorithm for multidimensional bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Improved bounds for harmonic-based bin packing algorithms
• An improved lower bound for on-line bin packing algorithms
• A simple on-line bin-packing algorithm

This page was built for publication: Two-dimensional on-line bin packing problem with rotatable items.