Lower bounds for batched bin packing
From MaRDI portal
Publication:2125232
DOI10.1007/S10878-021-00797-ZzbMATH Open1490.90235OpenAlexW3194765939MaRDI QIDQ2125232FDOQ2125232
János Balogh, Leah Epstein, György Dósa, Asaf Levin, József Békési
Publication date: 13 April 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00797-z
Recommendations
Cites Work
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- New lower bounds for certain classes of bin packing algorithms
- A lower bound for on-line bin packing
- An improved lower bound for on-line bin packing algorithms
- New Algorithms for Bin Packing
- Bounds for online bin packing with cardinality constraints
- Batched bin packing
- A new lower bound for classic online bin packing
- Batched bin packing revisited
- Title not available (Why is that?)
- Parametric Lower Bound for On-Line Bin-Packing
- Lower bounds for several online variants of bin packing
- Lower bound for 3-batched bin packing
- More on batched bin packing
- A lower bound for online rectangle packing
Cited In (7)
- Several methods of analysis for cardinality constrained bin packing
- New lower bounds for certain classes of bin packing algorithms
- New Lower Bounds for Certain Classes of Bin Packing Algorithms
- Lower bounds and reduction procedures for the bin packing problem
- Open-end bin packing: new and old analysis approaches
- Batched bin packing
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
This page was built for publication: Lower bounds for batched bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125232)
