Algorithm 1 shows the recursive procedure to fill a bin presented by Fleszar and Hindi [21]; it begins with 𝑞=1q=1 and 𝐴=𝐴∗=∅A=A*=∅, where A is the subset currently assigned to the packing, and 𝐴∗A* is the subset with the smaller slack (𝑠(𝐴))(s(A)...