Packing batches of cubes into a single bin

DOI10.1016/J.IPL.2022.106337MaRDI QIDQ2680229zbMATH OpenOpenAlexFDO

Authors Janusz Januszewski, Łukasz Zielonka

Publication date 30 January 2023

Published in Information Processing Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.ipl.2022.106337

zbMATH Keywords

algorithmsbatched packingcubeonline packingpacking

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Batched bin packing
• Batched bin packing revisited
• Covering and packing properties of bounded sequences of convex sets
• Efficient online packing of 4-dimensional cubes into the unit cube
• Improved bound for online square-into-square packing
• Lower bound for 3-batched bin packing
• More on batched bin packing
• On packing of squares and cubes
• On-line packing sequences of cubes in the unit cube
• Online packing of \(d\)-dimensional boxes into the unit cube
• Packing batches of items into a single bin
• Packing rectangles into the unit square
• Some packing and covering theorems

Cited in

(6)

• More on batched bin packing
• Best packing of rods into boxes
• scientific article; zbMATH DE number 67150 (Why is no real title available?)
• scientific article; zbMATH DE number 1512676 (Why is no real title available?)
• Packing of non-blocking cubes into the unit cube
• Packing of non-blocking squares into the unit square

This page was built for publication: Packing batches of cubes into a single bin

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680229)