NF-based algorithms for online bin packing with buffer and bounded item size
From MaRDI portal
Publication:2355990
DOI10.1007/s10878-014-9771-8zbMath1319.90060OpenAlexW1982495803MaRDI QIDQ2355990
Publication date: 28 July 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9771-8
Related Items (2)
Tight bounds for NF-based bounded-space online bin packing algorithms ⋮ Online bin packing problem with buffer and bounded size revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- More on online bin packing with two item sizes
- Repacking helps in bounded space on-line bin-packing
- Linear time-approximation algorithms for bin packing
- Dynamic bin packing with unit fraction items revisited
- Fast algorithms for bin packing
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- On-line bin packing with restricted repacking
- Algorithms for the Relaxed Online Bin-Packing Model
- New Lower Bounds for Certain Classes of Bin Packing Algorithms
- On the online bin packing problem
- Dynamic Bin Packing
- New Algorithms for Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- On-line bin packing in linear time
- On-line bin packing ? A restricted survey
This page was built for publication: NF-based algorithms for online bin packing with buffer and bounded item size
