Bounds for online bounded space hypercube packing
From MaRDI portal
Publication:2467129
DOI10.1016/j.disopt.2006.11.005zbMath1163.90603WikidataQ105583599 ScholiaQ105583599MaRDI QIDQ2467129
Publication date: 18 January 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/11032
90C27: Combinatorial optimization
90C39: Dynamic programming
90B80: Discrete location and assignment
Related Items
Efficient Approximations for the Online Dispersion Problem, Prices of Anarchy of Selfish 2D Bin Packing Games, A bounded space algorithm for online circle packing, Online square-into-square packing, A note on online hypercube packing, Two-dimensional online bin packing with rotation, A note on one-space bounded square packing, Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing, Approximation and online algorithms for multidimensional bin packing: a survey, Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
Cites Work
- An on-line algorithm for multidimensional bin packing
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Two-dimensional rectangle packing: On-line methods and results
- New bounds for multidimensional packing
- Cube packing.
- Fast algorithms for bin packing
- A simple on-line bin-packing algorithm
- Optimal Online Algorithms for Multidimensional Packing Problems