Before revision:  Vector Bin Packing is a natural generalization of the classic bin packing problem where given a set of d-dimensional vectors from (0,1]^d, and the aim is to partition the set into  bins such that for each bin B, we have \left\|v\in Bv\right\|_\infty\leq 1.
After revision:  Vector Bin Packing is a natural generalization of the classic bin packing problem where given a set of d-dimensional vectors from (0,1]^d, and the aim is to partition the set into the minimum number of bins such that for each bin B, we have \left\|v\in Bv\right\|_\infty\leq 1.