Login / Signup
Beating the Harmonic lower bound for online bin packing.
Sandy Heydrich
Rob van Stee
Published in:
CoRR (2015)
Keyphrases
</>
bin packing
lower bound
upper bound
online algorithms
assembly line balancing
branch and bound algorithm
search tree
cutting stock
online learning
graph colouring
branch and bound
worst case
np hard
packing problem
optimal solution
lower and upper bounds
objective function