On-line bin packing with restricted repacking
From MaRDI portal
Publication:2436663
DOI10.1007/s10878-012-9489-4zbMath1286.90120OpenAlexW2002066789MaRDI QIDQ2436663
János Balogh, József Békési, Gábor Galambos, Gerhard Reinelt
Publication date: 25 February 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9489-4
Related Items
Semi-on-line bin packing: a short overview and a new lower bound, Dynamic Windows Scheduling with Reallocation, Tight bounds for NF-based bounded-space online bin packing algorithms, Fully-Dynamic Bin Packing with Little Repacking, Quasi-human seniority-order algorithm for unequal circles packing, NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation, Online bin packing with \((1,1)\) and \((2,R)\) bins, NF-based algorithms for online bin packing with buffer and bounded item size
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semi-on-line bin packing: a short overview and a new lower bound
- A fundamental restriction on fully dynamic maintenance of bin packing
- A lower bound for on-line bin packing
- Bin packing can be solved within 1+epsilon in linear time
- Improved bounds for harmonic-based bin packing algorithms
- Repacking helps in bounded space on-line bin-packing
- Dynamic bin packing with unit fraction items revisited
- Batched bin packing
- Dynamic bin packing of unit fractions items
- Algorithms for the Relaxed Online Bin-Packing Model
- New Lower Bounds for Certain Classes of Bin Packing Algorithms
- On Bin Packing with Conflicts
- On the online bin packing problem
- Lower Bound for the Online Bin Packing Problem with Restricted Repacking
- Dynamic Bin Packing
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- On-line bin packing in linear time
- The Approximation of Numbers as Sums of Reciprocals
