An Asymptotic Lower Bound for Online Vector Bin Packing

Nikhil Bansal, Ilan Reuven Cohen

We consider the online vector bin packing problem where $n$ items specified by $d$-dimensional vectors must be packed in the fewest number of identical $d$-dimensional bins. Azar e…