Optimal Online Algorithms for Multidimensional Packing Problems
From MaRDI portal
Recommendations
Cited in
(28)- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- New bounds for multidimensional packing
- Online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing
- Efficient 1-space bounded hypercube packing algorithm
- A lower bound for online rectangle packing
- Packing items to feed assembly lines
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Approximation and online algorithms for multidimensional bin packing: a survey
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Bounds for online bounded space hypercube packing
- Online algorithm for 1-space bounded multi-dimensional bin packing
- One-space bounded algorithms for two-dimensional bin packing
- Competitive multi-dimensional dynamic bin packing via L-shape bin packing
- Multidimensional Bin Packing Algorithms
- Efficient approximations for the online dispersion problem
- scientific article; zbMATH DE number 2119702 (Why is no real title available?)
- A tight lower bound for the online bounded space hypercube bin packing problem
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Algorithms – ESA 2004
- Optimal online bounded space multidimensional packing
- Online bin packing of squares and cubes
- Online bin packing of squares and cubes
- A bounded space algorithm for online circle packing
- Dynamic multi-dimensional bin packing
- A note on online hypercube packing
- An on-line algorithm for multidimensional bin packing
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- Two-dimensional online bin packing with rotation
This page was built for publication: Optimal Online Algorithms for Multidimensional Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470698)
