Online bin packing problem with buffer and bounded size revisited
From MaRDI portal
Publication:511697
DOI10.1007/S10878-015-9976-5zbMATH Open1361.90056OpenAlexW2279442010MaRDI QIDQ511697FDOQ511697
Xin Han, Hing-Fung Ting, Yan Lan, Minghui 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)
Cites Work
- Title not available (Why is that?)
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- New lower bounds for certain classes of bin packing algorithms
- Fast algorithms for bin packing
- New Algorithms for Bin Packing
- On-line bin packing in linear time
- Dynamic bin packing with unit fraction items revisited
- The trim problem
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- NF-based algorithms for online bin packing with buffer and bounded item size
- Online minimum makespan scheduling with a buffer
- More on online bin packing with two item sizes
Cited In (5)
- An asymptotic competitive scheme for online bin packing
- Bounds for online bin packing with cardinality constraints
- Tight bounds for NF-based bounded-space online bin packing algorithms
- A 4-space bounded approximation algorithm for online bin packing problem
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem
This page was built for publication: Online bin packing problem with buffer and bounded size revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511697)
