Optimal Bin Covering with Items of Random Size

DOI10.1137/0218034zbMath0675.90075OpenAlexW2088080491MaRDI QIDQ3830822

WanSoo T. Rhee, Michel Talagrand

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0218034

zbMATH Keywords

weak convergencecoveringcompactnesssize distributionprobability measureoptimal bin packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Operations research and management science (90B99) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (1)

Probabilistic analysis of a bin covering algorithm

This page was built for publication: Optimal Bin Covering with Items of Random Size