Two-dimensional rectangle packing: On-line methods and results
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 634028
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- GENERALIZED FIRST-FIT ALGORITHMS IN TWO AND THREE DIMENSIONS
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- On some packing problem related to dynamic storage allocation
Cites work
Cited in
(21)- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Online strip packing with modifiable boxes
- Two-dimensional online bin packing with rotation
- Online rectangle filling
- Online bin packing of squares and cubes
- Bounds for online bounded space hypercube packing
- An on-line algorithm for multidimensional bin packing
- Online bin packing of squares and cubes
- scientific article; zbMATH DE number 634028 (Why is no real title available?)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- A new nonlinear model for the two-dimensional rectangle packing problem
- Online Rectangle Filling
- scientific article; zbMATH DE number 1982176 (Why is no real title available?)
- On two dimensional packing
- Online algorithm for 1-space bounded multi-dimensional bin packing
- On-line algorithms for packing rectangles into several strips
- Packing rectangles in a strip
- A lower bound for online rectangle packing
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- On some packing problem related to dynamic storage allocation
- Efficient 1-space bounded hypercube packing algorithm
This page was built for publication: Two-dimensional rectangle packing: On-line methods and results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309806)