Analysis of a Compound Bin Packing Algorithm

DOI10.1137/0404007zbMath0714.68033OpenAlexW2009408467MaRDI QIDQ3200540

Michael A. Langston, Donald K. Friesen

Publication date: 1991

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1158c14e0d49faae1cd4f9f63d9fda40cdce0623

zbMATH Keywords

heuristicsworst-case analysisbin packingweighting functioncompound algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (12)

Single machine scheduling with job delivery to multiple customers ⋮ Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time ⋮ Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Between a rock and a hard place: the two-to-one assignment problem ⋮ Unnamed Item ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ Resource allocation under limited sharing ⋮ A linear compound algorithm for uniform machine scheduling ⋮ On lazy bin covering and packing problems ⋮ Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps ⋮ Modified subset sum heuristics for bin packing

This page was built for publication: Analysis of a Compound Bin Packing Algorithm