A tight lower bound for the online bounded space hypercube bin packing problem.
Yoshiharu KohayakawaFlávio Keidi MiyazawaYoshiko WakabayashiPublished in: CoRR (2021)
Keyphrases
- lower bound
- upper bound
- online algorithms
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- optimal solution
- worst case
- lower and upper bounds
- search space
- upper and lower bounds
- space time
- lower bounding
- low dimensional
- online learning
- real time
- neural network
- sample complexity
- parameter space
- parallel algorithm
- genetic algorithm
- combinatorial optimization
- higher dimensional
- evolutionary algorithm
- learning algorithm
- master slave