Lower bound for 3-batched bin packing

DOI10.1016/J.DISOPT.2016.04.007zbMath1387.90205OpenAlexW2418108244MaRDI QIDQ1751161

János Balogh, József Békési, Gábor Galambos, Zhiyi Tan, György Dósa

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.04.007

zbMATH Keywords

lower boundworst-case behaviorbatched bin packing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (12)

Lower bounds for batched bin packing ⋮ Batched bin packing revisited ⋮ Open-end bin packing: new and old analysis approaches ⋮ Packing batches of cubes into a single bin ⋮ Batch Coloring of Graphs ⋮ On bin packing with clustering and bin packing with delays ⋮ Batch coloring of graphs ⋮ More on batched bin packing ⋮ A new lower bound for classic online bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ A lower bound for online rectangle packing ⋮ Several methods of analysis for cardinality constrained bin packing

Cites Work

• Unnamed Item
• New lower bounds for certain classes of bin packing algorithms
• Batched bin packing
• Batched bin packing revisited
• A simple on-line bin-packing algorithm
• Beating the Harmonic Lower Bound for Online Bin Packing

This page was built for publication: Lower bound for 3-batched bin packing