Improved bounds for harmonic-based bin packing algorithms

DOI10.1016/0166-218X(91)90087-DzbMath0768.68058MaRDI QIDQ1182320

Michael B. Richey

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

asymptotic performance boundharmonic bin packing algorithm

Mathematics Subject Classification ID

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

Related Items (17)

Shelf algorithms for on-line strip packing ⋮ Assigning service requests in voice-over-internet gateway multiprocessors ⋮ Algorithms for on-line bin-packing problems with cardinality constraints ⋮ Semi-on-line bin packing: a short overview and a new lower bound ⋮ Approximate strip packing: revisited ⋮ A survey on combinatorial optimization in dynamic environments ⋮ On-line bin packing ? A restricted survey ⋮ Unnamed Item ⋮ On-line bin packing with restricted repacking ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ A new upper bound for the online square packing problem in a strip ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ A note on an open-end bin packing problem ⋮ On-line grid-packing with a single active grid ⋮ Applying extra-resource analysis to load balancing. ⋮ Two-dimensional on-line bin packing problem with rotatable items. ⋮ A manifesto for the computational method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for on-line bin packing
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing
• On-line bin packing in linear time

This page was built for publication: Improved bounds for harmonic-based bin packing algorithms