Online bin packing with (1,1) and (2,R) bins
From MaRDI portal
Publication:2355985
DOI10.1007/S10878-014-9749-6zbMATH Open1319.90054OpenAlexW2034328262MaRDI QIDQ2355985FDOQ2355985
Hing-Fung Ting, Jing Chen, Xin Han, Kazuo Iwama
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-9749-6
Recommendations
Cites Work
- Semi-on-line bin packing: a short overview and a new lower bound
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- A lower bound for on-line bin packing
- An improved lower bound for on-line bin packing algorithms
- Fast algorithms for bin packing
- New Algorithms for Bin Packing
- On-line bin packing with restricted repacking
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Variable Sized Bin Packing
- New Bounds for Variable-Sized Online Bin Packing
- Online variable-sized bin packing
- An on-line algorithm for variable-sized bin packing
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
Cited In (3)
This page was built for publication: Online bin packing with \((1,1)\) and \((2,R)\) bins
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355985)
