A note on online hypercube packing
From MaRDI portal
Recommendations
Cites work
- A lower bound for on-line bin packing
- A simple on-line bin-packing algorithm
- An improved lower bound for on-line bin packing algorithms
- An on-line algorithm for multidimensional bin packing
- Bounds for online bounded space hypercube packing
- Cube packing.
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- New Algorithms for Bin Packing
- New bounds for multidimensional packing
- On the online bin packing problem
- On-line bin packing in linear time
- Online square and cube packing
- Optimal Online Algorithms for Multidimensional Packing Problems
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(13)- A note on online strip packing
- A new upper bound for the online square packing problem in a strip
- Constructive heuristics for the canister filling problem
- A lower bound for online rectangle packing
- Approximation and online algorithms for multidimensional bin packing: a survey
- Online circle and sphere packing
- Bounds for online bounded space hypercube packing
- Online square and cube packing
- Efficient online packing of 4-dimensional cubes into the unit cube
- Improved Online Hypercube Packing
- Online bin packing of squares and cubes
- Online bin packing of squares and cubes
- Two-dimensional online bin packing with rotation
This page was built for publication: A note on online hypercube packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623793)