A class of simple stochastic online bin packing algorithms

DOI10.1007/BF02241699zbMath0478.68073MaRDI QIDQ1161297

S. Singh

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

stochastic algorithmsapproximation algorithmsbin packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (5)

Assigning service requests in voice-over-internet gateway multiprocessors ⋮ Expected performance of the shelf heuristic for 2-dimensional packing ⋮ Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers ⋮ Average-case analysis of cutting and packing in two dimensions ⋮ A linear time bin-packing algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
• Fast algorithms for bin packing
• A stochastic model of bin-packing
• On the theory of order statistics

This page was built for publication: A class of simple stochastic online bin packing algorithms