Online bin packing problem with buffer and bounded size revisited
From MaRDI portal
Publication:511697
DOI10.1007/s10878-015-9976-5zbMath1361.90056OpenAlexW2279442010MaRDI QIDQ511697
Xin Han, Hing-Fung Ting, Yan Lan, Ming-Hui Zhang
Publication date: 22 February 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9976-5
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- New lower bounds for certain classes of bin packing algorithms
- More on online bin packing with two item sizes
- Dynamic bin packing with unit fraction items revisited
- Fast algorithms for bin packing
- NF-based algorithms for online bin packing with buffer and bounded item size
- The Trim Problem
- ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- On-line bin packing in linear time
This page was built for publication: Online bin packing problem with buffer and bounded size revisited