Batched bin packing
From MaRDI portal
Publication:1779689
DOI10.1016/j.disopt.2004.11.001zbMath1140.90476OpenAlexW1963608587MaRDI QIDQ1779689
Gregory Gutin, Anders Yeo, Tommy R. Jensen
Publication date: 1 June 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.11.001
Related Items (18)
Lower bounds for batched bin packing ⋮ Semi-on-line bin packing: a short overview and a new lower bound ⋮ Batched bin packing revisited ⋮ Open-end bin packing: new and old analysis approaches ⋮ Packing batches of cubes into a single bin ⋮ Tight bounds for NF-based bounded-space online bin packing algorithms ⋮ Batch Coloring of Graphs ⋮ On-line bin packing with restricted repacking ⋮ On bin packing with clustering and bin packing with delays ⋮ Lower bound for 3-batched bin packing ⋮ More on online bin packing with two item sizes ⋮ Batch coloring of graphs ⋮ Resource augmented semi-online bounded space bin packing ⋮ More on batched bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Improved lower bounds for semi-online bin packing problems ⋮ Packing batches of items into a single bin ⋮ Several methods of analysis for cardinality constrained bin packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
- Online algorithms. The state of the art
- A lower bound for on-line bin packing
- Does randomization help in on-line bin packing?
- An improved lower bound for on-line bin packing algorithms
- Repacking helps in bounded space on-line bin-packing
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- An on-line bin-batching problem.
This page was built for publication: Batched bin packing
