Online bin packing with (1,1) and (2,R) bins
From MaRDI portal
Publication:2355985
Recommendations
Cites work
- A lower bound for on-line bin packing
- A simple on-line bin-packing algorithm
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- An improved lower bound for on-line bin packing algorithms
- An on-line algorithm for variable-sized bin packing
- Fast algorithms for bin packing
- New Algorithms for Bin Packing
- New Bounds for Variable-Sized Online Bin Packing
- On the online bin packing problem
- On-line bin packing with restricted repacking
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Online variable-sized bin packing
- Semi-on-line bin packing: a short overview and a new lower bound
- Variable Sized Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(7)- Online packing of arbitrary sized items into designated and multipurpose bins
- Comparing the costs of any fit algorithms for bin packing
- On bin packing with clustering and bin packing with delays
- Online Bin Packing with (1,1) and (2,R) Bins
- Research on online bin packing model with item size no more than \(\frac{1}{2}\)
- A new upper bound 2.5545 on 2D Online Bin Packing
- More on online bin packing with two item sizes
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)
