Back

G-97-05

Upper Bounds and Algorithms for the Maximum Cardinality Bin Packing Problem

, , and

BibTeX reference

In the Maximum Cardinality Bin Packing Problem, we are given m bins of capacity c and n items of weights wi (i=1,...,n). The objective is to maximize the number of items packed into the m bins without exceeding bin capacities and without splitting items. Several upper bounds are derived. These are then embedded in an enumeration algorithm. Computational results indicate that the algorithm typically identifies an optimal solution within very low computing times.

, 14 pages

This cahier was revised in April 2002

Research Axis

Research application

Publication

Upper Bounds and Algorithms for the Maximum Cardinality Bin Packing Problem
, , and
European Journal of Operational Research, 149, 490–498, 2003 BibTeX reference