Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem.

Martin Böhm Bertrand Simon

Published in: CoRR (2020)

Keyphrases

lower bound
online algorithms
upper bound
online learning
lower and upper bounds
objective function
learning environment
scheduling problem
worst case
real time
data sets
special case
np hard
vc dimension
lower bounding
optimal cost