Beating the Harmonic Lower Bound for Online Bin Packing.

Sandy Heydrich Rob van Stee

Published in: ICALP (2016)

Keyphrases

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