Analysis of a Compound Bin Packing Algorithm

DOI10.1137/0404007zbMATH Open0714.68033OpenAlexW2009408467MaRDI QIDQ3200540FDOQ3200540

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

heuristicsbin packingworst-case analysisweighting functioncompound algorithm

Mathematics Subject Classification ID

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

Cited In (15)

• Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
• Algorithmic analysis of priority-based bin packing
• Resource allocation under limited sharing
• Deep performance analysis of refined harmonic bin packing algorithm
• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
• Modified subset sum heuristics for bin packing
• Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
• Between a rock and a hard place: the two-to-one assignment problem
• Single machine scheduling with job delivery to multiple customers
• Homogeneous grouping of non-prime steel products for online auctions: a case study
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
• A linear compound algorithm for uniform machine scheduling
• On lazy bin covering and packing problems
• Analysis of a Hybrid Algorithm for Packing Unequal Bins
• Title not available (Why is that?)

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

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