Probabilistic analysis of a bin covering algorithm

DOI10.1016/0167-6377(95)00053-4zbMath0855.90106OpenAlexW2086436817MaRDI QIDQ1919189

Joseph Y.-T. Leung, Dawei Hong, Sunan Han

Publication date: 1 August 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00053-4

zbMATH Keywords

bin coveringNP-hardheuristicbin packingasymptotic average-case behavioriterated-lowest-fit-decreasing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (1)

Approximation of some NP-hard optimization problems by finite machines, in probability

Cites Work

• Unnamed Item
• A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
• On a dual version of the one-dimensional bin packing problem
• Probabilistic analysis of algorithms for dual bin packing problems
• Optimal Bin Covering with Items of Random Size
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Recurrence properties of Processes with stationary independent increments

This page was built for publication: Probabilistic analysis of a bin covering algorithm