Packing batches of cubes into a single bin
From MaRDI portal
Publication:2680229
DOI10.1016/j.ipl.2022.106337OpenAlexW4304789318MaRDI QIDQ2680229
Janusz Januszewski, Łukasz Zielonka
Publication date: 30 January 2023
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106337
Cites Work
- On-line packing sequences of cubes in the unit cube
- Packing rectangles into the unit square
- Lower bound for 3-batched bin packing
- Batched bin packing
- More on batched bin packing
- Packing batches of items into a single bin
- Online packing of \(d\)-dimensional boxes into the unit cube
- Batched bin packing revisited
- Improved Bound for Online Square-into-Square Packing
- Covering and packing properties of bounded sequences of convex sets
- Efficient online packing of 4-dimensional cubes into the unit cube
- Some packing and covering theorems
- On packing of squares and cubes
This page was built for publication: Packing batches of cubes into a single bin