A New Lower Bound for Classic Online Bin Packing.
János BaloghJózsef BékésiGyörgy DósaLeah EpsteinAsaf LevinPublished in: WAOA (2019)
Keyphrases
- bin packing
- lower bound
- upper bound
- graph colouring
- online algorithms
- assembly line balancing
- search tree
- cutting stock
- online learning
- branch and bound
- branch and bound algorithm
- np hard
- search algorithm
- optimal solution
- objective function
- lower and upper bounds
- orders of magnitude
- linear programming
- sufficiently accurate