A tight lower bound for the online bounded space hypercube bin packing problem.
Yoshiharu KohayakawaFlávio Keidi MiyazawaYoshiko WakabayashiPublished in: Discret. Math. Theor. Comput. Sci. (2021)
Keyphrases
- lower bound
- upper bound
- online algorithms
- branch and bound algorithm
- worst case
- np hard
- objective function
- branch and bound
- lower and upper bounds
- optimal solution
- online learning
- space time
- real time
- low dimensional
- higher dimensional
- lagrangian relaxation
- search engine
- high dimensional
- search space
- dynamic programming