I am trying to figure the number ways you can pack K items into N bins where all bins have a uniform capacity of R.
For instance, lets say you have 3 items and 4 bins, where each bin has a capacity of 2.
One possible arrangement shown here
Does anyone know how to calculate this number of combinations? I am familiar with combinations with repetition but I'm not sure about the case where all bins have the same capacity R. I have seen some similar posts but couldn't find any with this problem setup.