Dynamic multi-dimensional bin packing

DOI10.1016/j.jda.2010.07.002zbMath1208.90144OpenAlexW2051308121MaRDI QIDQ616986

Leah Epstein, Meital Levy

Publication date: 20 January 2011

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2010.07.002

zbMATH Keywords

online algorithmsdynamic algorithmsmulti-dimensional packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

Semi-on-line bin packing: a short overview and a new lower bound ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Prices of Anarchy of Selfish 2D Bin Packing Games ⋮ A comparative review of 3D container loading algorithms ⋮ Constraints in container loading -- a state-of-the-art review

Cites Work

• Unnamed Item
• An on-line algorithm for multidimensional bin packing
• An approximation algorithm for square packing.
• On dynamic bin packing: An improved lower bound and resource augmentation analysis
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• New bounds for multidimensional packing
• Cube packing.
• Multidimensional cube packing
• Dynamic bin packing of unit fractions items
• Online square and cube packing
• Dynamic Bin Packing
• A simple on-line bin-packing algorithm
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Packing d-Dimensional Bins in d Stages
• Improved Online Hypercube Packing
• Optimal Online Algorithms for Multidimensional Packing Problems
• On packing of squares and cubes

This page was built for publication: Dynamic multi-dimensional bin packing