Comparing the costs of any fit algorithms for bin packing

DOI10.1016/J.ORL.2022.09.006OpenAlexW4297372090MaRDI QIDQ2102827FDOQ2102827

Authors Asaf Levin

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

zbMATH Keywords

online algorithmsanalysis of algorithmsbin packingworst-case analysis

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Online bin packing: old algorithms and new results
• scientific article; zbMATH DE number 2090002
• scientific article; zbMATH DE number 2016849
• Online variable-sized bin packing
• Online bin packing with \((1,1)\) and \((2,R)\) bins

Cites work

• scientific article; zbMATH DE number 871933 (Why is no real title available?)
• A new and improved algorithm for online bin packing
• A new lower bound for classic online bin packing
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
• Colored bin packing: online algorithms and lower bounds
• Comparing online algorithms for bin packing problems
• Fast algorithms for bin packing
• More on ordered open end bin packing
• Offline black and white bin packing
• On online bin packing with LIB constraints
• Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
• Online bin packing: old algorithms and new results
• Online results for black and white bin packing
• Online-bounded analysis
• The relative worst order ratio for online algorithms
• Tight results for next fit and worst fit with resource augmentation
• Two-bounded-space bin packing revisited

This page was built for publication: Comparing the costs of any fit algorithms for bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102827)