In the Dual Bin Packing Problem (DBP), there are an unlimited number of bins of identical capacity, and unsplittable items of given weights. The aim is to pack items in as many bins as possible so that the total weight of each bin is at least equal to its capacity. This article proposes reduction criteria, upper bounds, and an enumerative algorithm for the DBP. Computational results are presented.
Paru en mai 1993 , 18 pages
Ce cahier a été révisé en janvier 1994