Online bin packing problem with buffer and bounded size revisited
From MaRDI portal
Publication:511697
Recommendations
- NF-based algorithms for online bin packing with buffer and bounded item size
- Resource augmented semi-online bounded space bin packing
- NF-based algorithms for online bin packing with buffer and item size limitation
- Research on online bin packing model with item size no more than \(\frac{1}{2}\)
- scientific article; zbMATH DE number 1670832
Cites work
- A simple on-line bin-packing algorithm
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- Dynamic bin packing with unit fraction items revisited
- Fast algorithms for bin packing
- More on online bin packing with two item sizes
- NF-based algorithms for online bin packing with buffer and bounded item size
- New Algorithms for Bin Packing
- New lower bounds for certain classes of bin packing algorithms
- On the online bin packing problem
- On-line bin packing in linear time
- On-line bin packing with two item sizes
- Online minimum makespan scheduling with a buffer
- The trim problem
Cited in
(9)- Research on online bin packing model with item size no more than \(\frac{1}{2}\)
- NF-based algorithms for online bin packing with buffer and bounded item size
- An asymptotic competitive scheme for online bin packing
- NF-based algorithms for online bin packing with buffer and item size limitation
- Batched 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)
