On-line algorithms for 2-space bounded 2-dimensional bin packing
From MaRDI portal
Publication:456101
DOI10.1016/J.IPL.2012.06.016zbMATH Open1248.68572OpenAlexW1979728490MaRDI QIDQ456101FDOQ456101
Authors: Janusz Januszewski
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.016
Recommendations
- Online algorithms for 1-space bounded 2-dimensional bin packing and square 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
- One-space bounded algorithms for two-dimensional bin packing
- 1-bounded space algorithms for 2-dimensional bin packing
Cites Work
- On Packing Two-Dimensional Bins
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Online removable square packing
- On-line grid-packing with a single active grid
- On-line packing sequences of cubes in the unit cube
- Packing rectangles into the unit square
- Online square and cube packing
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- On-line packing squares into \(n\) unit squares
- One-space bounded algorithms for two-dimensional bin packing
- Bounded space on-line bin packing: Best is better than first
Cited In (13)
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- Improved Space for Bounded-Space, On-Line Bin-Packing
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- Title not available (Why is that?)
- Two-dimensional on-line bin packing problem with rotatable items.
- Online packing of rectangular items into square bins
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- Title not available (Why is that?)
- 1-bounded space algorithms for 2-dimensional bin packing
- One-space bounded algorithms for two-dimensional bin packing
- A new upper bound 2.5545 on 2D Online Bin Packing
- A note on one-space bounded square packing
This page was built for publication: On-line algorithms for 2-space bounded 2-dimensional bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456101)