This directory contains a series of bin packing instances to be used
as a testbed for cardinality-constrained problems.

There is an exact solution for each instance (which corresponds to the
order of the items in the files), so it is easy to know if the
algorithms used for solving it are good or not.

The Python program used to produce the files is 'mkinstance.py';
please read it for further details.

*** On version 0.2 the weights are integer; 
    bin capacity is set to 100000 
    This is for avoiding rounding problems ***

The file names are 
   cbt-SEED-ITEMS-BINS.dat
where
   SEED is the seed used for pseudo-random number generation
   ITEMS is the number of items per bin
   BINS is the total (optimal) number of bins

Please send comments/suggestions to
   Joao Pedro Pedroso  jpp@ncc.up.pt