A New Lower Bound for Classic Online Bin Packing.

János Balogh József Békési György Dósa Leah Epstein Asaf Levin

Published in: Algorithmica (2021)

Keyphrases

bin packing
lower bound
online algorithms
upper bound
assembly line balancing
online learning
branch and bound algorithm
search tree
graph colouring
worst case
cutting stock
packing problem
branch and bound
np hard
lower and upper bounds
objective function
database
data structure
optimal solution