Consider a 2-BP problem with W = 11, L = 16 and n = 6, where the characteristics (wi,li) of each object i, i = 1,..., 6, are
{(6,8), (6,8), (7,8), (4,9), (5,7), (4,4), (5,6)}.
• Use the BL heuristic to determine the number of bins to use;
• determine a lower bound z(I) on the number of bins;
• according to the value of z(I) obtained before, determine whether the use of the BL heuristic allows one to obtain the minimum number of bins used.