A lower bound for online rectangle packing
From MaRDI portal
Publication:2331592
DOI10.1007/s10878-019-00423-zzbMath1431.90130arXiv1811.09573OpenAlexW2962913470WikidataQ127824340 ScholiaQ127824340MaRDI QIDQ2331592
Publication date: 29 October 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.09573
Related Items (5)
Lower bounds for batched bin packing ⋮ A note on a variant of the online open end bin packing problem ⋮ Online bin packing of squares and cubes ⋮ Online bin packing of squares and cubes ⋮ More on ordered open end bin packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New lower bounds for certain classes of bin packing algorithms
- A note on online hypercube packing
- An on-line algorithm for multidimensional bin packing
- Two-dimensional online bin packing with rotation
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- An improved lower bound for on-line bin packing algorithms
- Two-dimensional rectangle packing: On-line methods and results
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- New bounds for multidimensional packing
- Lower bound for 3-batched bin packing
- Two-dimensional on-line bin packing problem with rotatable items.
- Improved lower bounds for the online bin packing problem with cardinality constraints
- Online square and cube packing
- Bounds for online bin packing with cardinality constraints
- A new upper bound 2.5545 on 2D Online Bin Packing
- The Ordered Open-End Bin-Packing Problem
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Optimal Online Algorithms for Multidimensional Packing Problems
- Lower bounds for several online variants of bin packing
- A new lower bound for classic online bin packing
This page was built for publication: A lower bound for online rectangle packing
