Semi-on-line bin packing: a short overview and a new lower bound
From MaRDI portal
Publication:301113
DOI10.1007/s10100-012-0266-3zbMath1339.90272OpenAlexW2063792916MaRDI QIDQ301113
Publication date: 29 June 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-012-0266-3
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
Semi-on-line bin packing: a short overview and a new lower bound ⋮ Dynamic Windows Scheduling with Reallocation ⋮ On-line bin packing with restricted repacking ⋮ Unnamed Item ⋮ Lower bounds for several online variants of bin packing ⋮ Editorial ⋮ Online bin packing with \((1,1)\) and \((2,R)\) bins ⋮ Online bin packing with advice
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
- Semi-on-line bin packing: a short overview and a new lower bound
- New lower bounds for certain classes of bin packing algorithms
- Dynamic multi-dimensional bin packing
- A fundamental restriction on fully dynamic maintenance of bin packing
- Resource augmented semi-online bounded space bin packing
- A robust APTAS for the classical bin packing problem
- Improved lower bounds for semi-online bin packing problems
- Multidimensional on-line bin packing: Algorithms and worst-case analysis
- Bin packing can be solved within 1+epsilon in linear time
- Improved bounds for harmonic-based bin packing algorithms
- An improved lower bound for on-line bin packing algorithms
- Repacking helps in bounded space on-line bin-packing
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- Dynamic bin packing with unit fraction items revisited
- Batched bin packing
- Dynamic bin packing of unit fractions items
- On-line bin packing with restricted repacking
- Algorithms for the Relaxed Online Bin-Packing Model
- On Bin Packing with Conflicts
- On the online bin packing problem
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Lower Bound for the Online Bin Packing Problem with Restricted Repacking
- Dynamic Bin Packing
- A simple on-line bin-packing algorithm
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- On-line bin packing in linear time
This page was built for publication: Semi-on-line bin packing: a short overview and a new lower bound
