On-Line Bin Packing of Items of Random Sizes, II

DOI10.1137/0222074MaRDI QIDQ4277540zbMATH OpenOpenAlexFDO

Authors Wansoo T. Rhee, Michel Talagrand

Publication date 15 August 1994

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

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

zbMATH Keywords

on-line bin packing

Mathematics Subject Classification ID

Stochastic programming (90C15) Inventory, storage, reservoirs (90B05) Combinatorial aspects of packing and covering (05B40)

Recommendations

• On Line Bin Packing with Items of Random Size
• scientific article; zbMATH DE number 1870507
• Does randomization help in on-line bin packing?
• An O(n) bin-packing algorithm for uniformly distributed data
• Optimal Bin Packing with Items of Random Sizes II

Cited in

(12)

• scientific article; zbMATH DE number 1870507 (Why is no real title available?)
• scientific article; zbMATH DE number 1515751 (Why is no real title available?)
• Stability of On-Line Bin Packing with Random Arrivals and Long-Run-Average Constraints
• Interior-point-based online stochastic bin packing
• An online bin-packing problem with an underlying ternary structure
• A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
• On-line sequential bin packing
• Average-case analysis of the modified harmonic algorithm
• Packing random items of three colors
• An O(n) bin-packing algorithm for uniformly distributed data
• Near-optimal algorithms for stochastic online bin packing
• Does randomization help in on-line bin packing?

This page was built for publication: On-Line Bin Packing of Items of Random Sizes, II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277540)