A tight lower bound for optimal bin packing

DOI10.1016/0167-6377(95)00041-0zbMath0855.90102OpenAlexW2142050419MaRDI QIDQ1919179

Heng-Yi Chao, Russell W. Quong, Mary P. Harper

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)00041-0

zbMATH Keywords

matchingbest fit decreasingone-dimensional bin packingtight lower boundharmonic partition

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem ⋮ New bin packing fast lower bounds ⋮ A note on minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• The average-case analysis of some on-line algorithms for bin packing
• Fast algorithms for bin packing
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing

This page was built for publication: A tight lower bound for optimal bin packing