Abstract
In this extended abstract, we present approximation algorithms for the following packing problems: the strip packing problem, the two-dimensional bin packing problem, the three-dimensional strip packing problem, and the three-dimensional bin packing problem. For all these problems, we consider orthogonal packings where 90° rotations are allowed. The algorithms we show for these problems have asymptotic performance bounds 1.613, 2.64, 2.76 and 4.89, respectively. We also present an algorithm for the z-oriented three-dimensional packing problem with asymptotic performance bound 2.64. To our knowledge the bounds presented here are the best known for each problem. © Springer-Verlag 2004.
Cite
CITATION STYLE
Miyazawa, F. K., & Wakabayashi, Y. (2004). Packing problems with orthogonal rotations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 359–368. https://doi.org/10.1007/978-3-540-24698-5_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
