Drawer algorithms for 1-space bounded multidimensional hyperbox packing
From MaRDI portal
Publication:2424663
DOI10.1007/s10878-018-0338-yzbMath1425.90094OpenAlexW2887600624MaRDI QIDQ2424663
Janusz Januszewski, Paulina Grzegorek
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0338-y
Related Items (1)
Cites Work
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- A lower bound for on-line bin packing
- An improved lower bound for on-line bin packing algorithms
- Two-dimensional rectangle packing: On-line methods and results
- New bounds for multidimensional packing
- Online packing of rectangular items into square bins
- Fast algorithms for bin packing
- A note on one-space bounded square packing
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- On-line Packing Cubes into $n$ Unit Cubes
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- A new upper bound 2.5545 on 2D Online Bin Packing
- On the online bin packing problem
- 2-space bounded online cube and hypercube packing
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Improved Space for Bounded-Space, On-Line Bin-Packing
- Beating the Harmonic Lower Bound for Online Bin Packing
- On-line bin packing in linear time
- Optimal Online Algorithms for Multidimensional Packing Problems
This page was built for publication: Drawer algorithms for 1-space bounded multidimensional hyperbox packing
