Algorithms for computing the ℎ-range of the postage stamp problem
Svein Mossige · Mathematics of Computation · 1981
New algorithms, based on a very efficient method to compute the h -range, have been used to extend known tables of the extremal h -range, to complete the solution in the case k = 3 k = 3 , and to find a lower bound for the extremal 2-range.