Lower Bound for the Online Bin Packing Problem with Restricted Repacking.
János BaloghJózsef BékésiGábor GalambosGerhard ReineltPublished in: SIAM J. Comput. (2008)
Keyphrases
- lower bound
- upper bound
- online algorithms
- branch and bound algorithm
- np hard
- branch and bound
- lower and upper bounds
- optimal solution
- online learning
- objective function
- worst case
- lower bounding
- real time
- neural network
- online environment
- linear programming relaxation
- upper and lower bounds
- search algorithm
- case study
- website
- data sets