Optimal Bin Packing with Items of Random Sizes III

DOI10.1137/0218033zbMath0698.90051OpenAlexW2044587680MaRDI QIDQ3476592

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/0218033

zbMATH Keywords

weak convergencesharp boundoptimal bin packing

Mathematics Subject Classification ID

Stochastic programming (90C15) Operations research and management science (90B99) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items

Probabilistic Analysis of a Vehicle Routing Problem with Time Windows ⋮ The stochastic generalized bin packing problem ⋮ Packing random items of three colors ⋮ Probabilistic analysis of a capactiated vehicle routing problem—I ⋮ Dual bin packing with items of random sizes ⋮ Bin Packing with Queues