Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
From MaRDI portal
Publication:2392739
DOI10.1007/S10878-012-9457-ZzbMATH Open1275.90086OpenAlexW2013063695MaRDI QIDQ2392739FDOQ2392739
Authors: Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han 
Publication date: 2 August 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9457-z
Recommendations
- Online algorithm for 1-space bounded multi-dimensional bin packing
- 2-space bounded online cube and hypercube packing
- Online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Optimal Online Algorithms for Multidimensional Packing Problems
Cites Work
- Title not available (Why is that?)
- A 71/60 theorem for bin packing
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- On Packing Two-Dimensional Bins
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Title not available (Why is that?)
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- An improved lower bound for on-line bin packing algorithms
- New bounds for multidimensional packing
- A new upper bound 2.5545 on 2D Online Bin Packing
- New Algorithms for Bin Packing
- On-line bin packing in linear time
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Multidimensional cube packing
- On packing of squares and cubes
- Online removable square packing
- On-line grid-packing with a single active grid
- On-line packing sequences of cubes in the unit cube
- Online square and cube packing
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- Bounded space on-line bin packing: Best is better than first
- Bounds for online bounded space hypercube packing
- Optimal Online Algorithms for Multidimensional Packing Problems
- Two-dimensional rectangle packing: On-line methods and results
Cited In (19)
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- 2-space bounded online cube and hypercube packing
- Optimal online bounded space multidimensional packing
- NF-based algorithms for online bin packing with buffer and bounded item size
- Online bin packing with \((1,1)\) and \((2,R)\) bins
- Bounds for online bounded space hypercube packing
- Dynamic multi-dimensional bin packing
- Improved Online Hypercube Packing
- Optimal Online Algorithms for Multidimensional Packing Problems
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Algorithms – ESA 2004
- Online algorithm for 1-space bounded multi-dimensional bin packing
- A tight lower bound for the online bounded space hypercube bin packing problem
- A 4-space bounded approximation algorithm for online bin packing problem
- Online Bin Packing with (1,1) and (2,R) Bins
- Online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing
- Efficient 1-space bounded hypercube packing algorithm
This page was built for publication: Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392739)
