This paper discusses a variation of the bin-packing problem in which we want to not only minimize the wasted space, but also choose the best bin :9I ; and the best packing into bins of this size to minimize wasted space. This problem reflects a memory allocation problem. Clearly this problem is NP-hard, as the authors point out. The authors later make this important observation: If a bin-packing algorithm A can guarantee a worst-case ratio R for the usual bin-packing problem, then an iterated version, A* can be used to achieve a bound as close to R as desired for this problem. The nmber of iterations is log :9I , for hich the base of the logarithm is :9I. It should be pointed out that the number of iterations is a function of :9I closeness to R. The paper presents a new problem and is clearly written.