Efficient 1-Space Bounded Hypercube Packing Algorithm
Abstract
References
Recommendations
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
We study a multidimensional hyperbox packing with one active bin. The items (d-dimensional hyperboxes of edge length not greater than 1) arrive one by one. Each item must be packed online into a hypercube bin of edge 1 and $$90^{\circ }$$90 -rotations ...
Online bin packing problem with buffer and bounded size revisited
In this paper we study the online bin packing with buffer and bounded size, i.e., there are items with size within $$(\alpha ,1/2]$$(ź,1/2] where $$0 \le \alpha < 1/2 $$0≤ź<1/2, and there is a buffer with constant size. Each time when a new item is given,...
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d -dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0