An Asymptotic Lower Bound for Online Vector Bin Packing.
Nikhil BansalIlan Reuven CohenPublished in: CoRR (2020)
Keyphrases
- bin packing
- lower bound
- upper bound
- online algorithms
- search tree
- worst case
- graph colouring
- assembly line balancing
- branch and bound algorithm
- online learning
- np hard
- packing problem
- cutting stock
- lower and upper bounds
- asymptotically optimal
- objective function
- genetic algorithm
- integer programming
- database management systems
- linear programming
- search algorithm
- optimal solution