Improved lower bounds for the online bin stretching problem.
Michaël GabayNadia BraunerVladimir KotovPublished in: 4OR (2017)
Keyphrases
- lower bound
- online algorithms
- upper bound
- online learning
- objective function
- np hard
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- real time
- lower bounding
- linear programming relaxation
- upper and lower bounds
- vc dimension
- improved algorithm
- special case
- search algorithm
- genetic algorithm
- data sets