| Article ID: | iaor1997333 |
| Country: | Netherlands |
| Volume: | 17 |
| Issue: | 1 |
| Start Page Number: | 9 |
| End Page Number: | 18 |
| Publication Date: | Feb 1995 |
| Journal: | Operations Research Letters |
| Authors: | Martello Silvano, Laporte Gilbert, Labb Martine |
| Keywords: | bin packing |
In the Dual Bin Packing Problem (DBP), there is 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.