Online Bin Packing with (1,1) and (2,R) Bins
From MaRDI portal
Publication:2867137
DOI10.1007/978-3-319-03780-6_34zbMath1407.90270MaRDI QIDQ2867137
Xin Han, Jing Chen, Kazuo Iwama, Hing-Fung Ting
Publication date: 10 December 2013
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_34
Cites Work
- Unnamed Item
- An on-line algorithm for variable-sized bin packing
- Online variable-sized bin packing
- A lower bound for on-line bin packing
- An improved lower bound for on-line bin packing algorithms
- Fast algorithms for bin packing
- LP models for bin packing and cutting stock problems
- On the online bin packing problem
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Variable Sized Bin Packing
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- New Bounds for Variable-Sized Online Bin Packing