Probabilistic analysis of a heuristic for the dual bin packing problem
type: Item
instance of: scholarly article
title: Probabilistic analysis of a heuristic for the dual bin packing problem
zbMATH Open document ID: 0682.68045
DOI: 10.1016/0020-0190(89)90088-4
author: Dean P. Foster
author: Rakesh V. Vohra
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4117848
zbMATH Keywords: probabilistic analysis
zbMATH Keywords: bin packing
zbMATH Keywords: first fit
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90088-4
OpenAlex ID: W1987979082
cites work: Probabilistic bounds for dual bin-packing
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: Bin packing: Maximizing the number of pieces packed
cites work: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
cites work: Optimal selection of stochastic intervals under a sum constraint
description: scientific article; zbMATH DE number 4117848