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: CoRR (2018)

Keyphrases

bin packing
lower bound
upper bound
online algorithms
search tree
graph colouring
branch and bound algorithm
packing problem
objective function
assembly line balancing
branch and bound
cutting stock
online learning
worst case
np hard
search strategy
constraint satisfaction
heuristic search
sufficiently accurate