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

DOI10.1016/S0304-3975(01)00410-8MaRDI QIDQ1853573zbMATH OpenFDO

Authors 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) Combinatorial optimization (90C27) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1696637
• Two-dimensional online bin packing with rotation
• Mathematical Foundations of Computer Science 2003
• On-line algorithms for 2-space bounded 2-dimensional bin packing
• Online packing of rectangular items into square bins

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A simple on-line bin-packing algorithm
• An improved lower bound for on-line bin packing algorithms
• An on-line algorithm for multidimensional bin packing
• Improved bounds for harmonic-based bin packing algorithms
• Multidimensional on-line bin packing: Algorithms and worst-case analysis

Cited in

(7)

• scientific article; zbMATH DE number 1696637 (Why is no real title available?)
• Two-dimensional online bin packing with rotation
• Online bin packing of squares and cubes
• Mathematical Foundations of Computer Science 2003
• Approximation and online algorithms for multidimensional bin packing: a survey
• Online bin packing of squares and cubes
• A lower bound for online rectangle packing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853573)