Comparing the costs of any fit algorithms for bin packing
From MaRDI portal
Publication:2102827
DOI10.1016/j.orl.2022.09.006OpenAlexW4297372090MaRDI QIDQ2102827
Publication date: 12 December 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.09.006
Cites Work
- Unnamed Item
- Unnamed Item
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- Tight results for next fit and worst fit with resource augmentation
- Online-bounded analysis
- Colored bin packing: online algorithms and lower bounds
- Fast algorithms for bin packing
- More on ordered open end bin packing
- Online results for black and white bin packing
- Offline black and white bin packing
- Comparing online algorithms for bin packing problems
- The relative worst order ratio for online algorithms
- Two-Bounded-Space Bin Packing Revisited
- On online bin packing with LIB constraints
- Online Bin Packing: Old Algorithms and New Results
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
- A new lower bound for classic online bin packing
This page was built for publication: Comparing the costs of any fit algorithms for bin packing
