Bounds for online bounded space hypercube packing
From MaRDI portal
Publication:2467129
DOI10.1016/J.DISOPT.2006.11.005zbMATH Open1163.90603OpenAlexW2081797760WikidataQ105583599 ScholiaQ105583599MaRDI QIDQ2467129FDOQ2467129
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
Combinatorial optimization (90C27) Dynamic programming (90C39) Discrete location and assignment (90B80)
Cites Work
- A simple on-line bin-packing algorithm
- New bounds for multidimensional packing
- Fast algorithms for bin packing
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Cube packing.
- Optimal Online Algorithms for Multidimensional Packing Problems
- An on-line algorithm for multidimensional bin packing
- Two-dimensional rectangle packing: On-line methods and results
Cited In (13)
- Efficient Approximations for the Online Dispersion Problem
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- Two-dimensional online bin packing with rotation
- Approximation and online algorithms for multidimensional bin packing: a survey
- Online bin packing of squares and cubes
- A note on online hypercube packing
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Prices of Anarchy of Selfish 2D Bin Packing Games
- A tight lower bound for the online bounded space hypercube bin packing problem
- A bounded space algorithm for online circle packing
- Online square-into-square packing
- Efficient 1-space bounded hypercube packing algorithm
- A note on one-space bounded square packing
Recommendations
- Online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing π π
- A tight lower bound for the online bounded space hypercube bin packing problem π π
- 2-space bounded online cube and hypercube packing π π
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing π π
- Title not available (Why is that?) π π
- A note on online hypercube packing π π
- Improved Online Hypercube Packing π π
- Online packing of \(d\)-dimensional boxes into the unit cube π π
- Tight bounds for online vector bin packing π π
- New Bounds for Online Packing LPs π π
This page was built for publication: Bounds for online bounded space hypercube packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467129)