Comparing the costs of any fit algorithms for bin packing
type: Item
instance of: scholarly article
title: Comparing the costs of any fit algorithms for bin packing
author: Asaf Levin
published in: Operations Research Letters
publication date: 2022-12-12T00:00:00Z
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7631929
zbMATH Keywords: bin packing
zbMATH Keywords: online algorithms
zbMATH Keywords: worst-case analysis
zbMATH Keywords: analysis of algorithms
MaRDI profile type: Publication
full work available at URL: j.orl.2022.09.006
OpenAlex ID: W4297372090
cites work: Offline black and white bin packing
cites work: Online results for black and white bin packing
cites work: Q5009562
cites work: A new lower bound for classic online bin packing
cites work: More on ordered open end bin packing
cites work: Colored bin packing: online algorithms and lower bounds
cites work: The relative worst order ratio for online algorithms
cites work: Tight results for next fit and worst fit with resource augmentation
cites work: Online-bounded analysis
cites work: Two-Bounded-Space Bin Packing Revisited
cites work: Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations
cites work: On online bin packing with LIB constraints
cites work: Comparing online algorithms for bin packing problems
cites work: Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
cites work: Fast algorithms for bin packing
cites work: Q4875207
cites work: Online Bin Packing: Old Algorithms and New Results
DOI: 10.1016/J.ORL.2022.09.006
description: scientific article; zbMATH DE number 7631929