Worst-case analysis of the FFH algorithm for online variable-sized bin packing
type: Item
instance of: scholarly article
title: Worst-case analysis of the FFH algorithm for online variable-sized bin packing
zbMATH Open document ID: 0843.90060
DOI: 10.1007/BF02309343
author: Yanyan Li
published in: Computing
publication date: 1996-03-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 856616
zbMATH Keywords: bin packing
zbMATH Keywords: online algorithm
zbMATH Keywords: FFH algorithm
zbMATH Keywords: right worst-case performance bound
MaRDI profile type: Publication
cites work: Variable Sized Bin Packing
cites work: Resource constrained scheduling as generalized bin packing
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Online variable-sized bin packing
description: scientific article; zbMATH DE number 856616