作者: Martine Labbé , Gilbert Laporte , Silvano Martello
DOI: 10.1016/0167-6377(94)00060-J
关键词:
摘要: In the Dual Bin Packing Problem (DBP), there is an unlimited number of bins identical capacity, and unsplittable items given weights. The aim to pack in as many possible so that total weight each bin at least equal its capacity. This article proposes reduction criteria, upper bounds, enumerative algorithm for DBP. Computational results are presented.