Parametric Lower Bound for On-Line Bin-Packing

DOI10.1137/0607041zbMath0593.90051OpenAlexW2017429942MaRDI QIDQ3724089

Gábor Galambos

Publication date: 1986

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

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

zbMATH Keywords

heuristic algorithmworst-case analysisparametric lower boundon-line bin-packing algorithm

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (8)

Lower bounds for batched bin packing ⋮ On-line bin packing ? A restricted survey ⋮ Parametric on-line algorithms for packing rectangles and boxes. ⋮ Tight bounds for NF-based bounded-space online bin packing algorithms ⋮ Does randomization help in on-line bin packing? ⋮ An improved lower bound for on-line bin packing algorithms ⋮ A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case ⋮ Resource augmented semi-online bounded space bin packing

Cites Work

• Unnamed Item
• A lower bound for on-line bin packing
• New Algorithms for Bin Packing
• A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Parametric Lower Bound for On-Line Bin-Packing