AN EXACT ALGORITHM FOR THE DUAL BIN PACKING PROBLEM

Authors
LABBE M LAPORTE G MARTELLO S
Citation
M. Labbe et al., AN EXACT ALGORITHM FOR THE DUAL BIN PACKING PROBLEM, Operations research letters, 17(1), 1995, pp. 9-18
Citations number
11
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Operations research letters → ACNP
ISSN journal
01676377
Volume
17
Issue
1
Year of publication
1995
Pages
9 - 18
Database
ISI
SICI code
0167-6377(1995)17:1<9:AEAFTD>2.0.ZU;2-Z
Abstract
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 pr oposes reduction criteria, upper bounds, and an enumerative algorithm for the DBP, Computational results are presented.