A new upper bound for the online square packing problem in a strip
From MaRDI portal
(Redirected from Publication:2012894)
Recommendations
Cites work
- A new lower bound for online strip packing
- A note on online hypercube packing
- A note on online strip packing
- A simple on-line bin-packing algorithm
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
- Improved bounds for harmonic-based bin packing algorithms
- Improved lower bound for online strip packing
- Lower bounds for on-line two-dimensional packing algorithms
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- New bounds for multidimensional packing
- On the online bin packing problem
- On-Line Multiple-Strip Packing
- On-line bin packing in linear time
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Online scheduling of parallel jobs on two machines is 2-competitive
- Online square and cube packing
- Orthogonal Packings in Two Dimensions
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Scheduling parallel jobs to minimize the makespan
- Shelf Algorithms for Two-Dimensional Packing Problems
- Strip Packing vs. Bin Packing
Cited in
(7)- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Exact solution techniques for two-dimensional cutting and packing
- On-line algorithms for packing rectangles into several strips
- Improved Lower Bound for Online Strip Packing
- A new lower bound for online strip packing
- Improved bound for online square-into-square packing
- New upper bounds for online strip packing
This page was built for publication: A new upper bound for the online square packing problem in a strip
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012894)
