One-space bounded algorithms for two-dimensional bin packing
From MaRDI portal
Publication:3069730
DOI10.1142/S0129054110007611zbMATH Open1206.68371MaRDI QIDQ3069730FDOQ3069730
Yong Zhang, Hing-Fung Ting, Francis Y. L. Chin
Publication date: 19 January 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- 1-bounded space algorithms for 2-dimensional bin packing
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- On-line algorithms for 2-space bounded 2-dimensional bin packing
Cites Work
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- On Packing Two-Dimensional Bins
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- An improved lower bound for on-line bin packing algorithms
- New Algorithms for Bin Packing
- On-line bin packing in linear time
- Multidimensional cube packing
- On packing of squares and cubes
- Online removable square packing
- On-line packing sequences of cubes in the unit cube
- Online square and cube packing
- Bounded space on-line bin packing: Best is better than first
- Optimal Online Algorithms for Multidimensional Packing Problems
Cited In (10)
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- Two-dimensional online bin packing with rotation
- On-line algorithms for 2-space bounded 2-dimensional bin packing
- On a dual version of the one-dimensional bin packing problem
- A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem
- 1-bounded space algorithms for 2-dimensional bin packing
- A multi-start gradient combination method for high-performance global search
- Efficient 1-space bounded hypercube packing algorithm
- A note on one-space bounded square packing
This page was built for publication: One-space bounded algorithms for two-dimensional bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069730)
