A new version of on-line variable-sized bin packing
type: Item
instance of: scholarly article
title: A new version of on-line variable-sized bin packing
zbMATH Open document ID: 0869.90041
DOI: 10.1016/S0166-218X(96)00018-2
published in: Discrete Applied Mathematics
publication date: 1997-03-05T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 986693
zbMATH Keywords: on-line variable-sized bin packing problem
zbMATH Keywords: worst-case performance bound
author: Guochuan Zhang
MaRDI profile type: Publication
cites work: A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
cites work: Q3347319
cites work: An on-line algorithm for variable-sized bin packing
cites work: Variable Sized Bin Packing
cites work: On-line bin packing ? A restricted survey
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Online variable-sized bin packing
cites work: Worst-case analysis of the FFH algorithm for online variable-sized bin packing
OpenAlex ID: W2056198897
description: scientific article; zbMATH DE number 986693