Drawer algorithms for 1-space bounded multidimensional hyperbox packing
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-018-0338-y
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Yong Zhang & Francis Y. L. Chin & Hing-Fung Ting & Xin Han, 2013. "Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 223-236, August.
- Csirik, J. & Frenk, J.B.G. & Labbé, M., 1993. "Two-dimensional rectangle packing: on-line methods and results," Econometric Institute Research Papers 11700, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Yong Zhang & Francis Y. L. Chin & Hing-Fung Ting & Xin Han, 2013. "Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 223-236, August.
- Feifeng Zheng & Li Luo & E. Zhang, 2015. "NF-based algorithms for online bin packing with buffer and bounded item size," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 360-369, August.
- Jing Chen & Xin Han & Kazuo Iwama & Hing-Fung Ting, 2015. "Online bin packing with (1,1) and (2, $$R$$ R ) bins," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 276-298, August.
- Leah Epstein, 2019. "A lower bound for online rectangle packing," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 846-866, October.
More about this item
Keywords
Online algorithms; Bin packing; Multidimensional; One-space bounded;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0338-y. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.