Optimal Bin Covering with Items of Random Size

DOI10.1137/0218034MaRDI QIDQ3830822zbMATH OpenOpenAlexFDO

Authors 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

compactnesscoveringoptimal bin packingprobability measuresize distributionweak convergence

Mathematics Subject Classification ID

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

Recommendations

• A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
• Optimal Bin Packing with Items of Random Sizes
• Optimal Bin Packing with Items of Random Sizes II
• Optimal Bin Packing of Items of Sizes Uniformly Distributed over [0, 1]
• Multidimensional Optimal Bin Packing with Items of Random Size
• Optimal Bin Packing with Items of Random Sizes III
• Probabilistic behaviour of optimal bin-packing solutions
• Bin covering with cardinality constraints
• Online Bin Covering: Expectations vs. Guarantees
• Probabilistic analysis of a bin covering algorithm

Cited in

(7)

• Probabilistic analysis of a bin covering algorithm
• Bin covering with cardinality constraints
• Online Bin Covering: Expectations vs. Guarantees
• Optimal Bin Packing of Items of Sizes Uniformly Distributed over [0, 1]
• A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
• Multidimensional Optimal Bin Packing with Items of Random Size
• scientific article; zbMATH DE number 1774262 (Why is no real title available?)

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

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