Algorithms for computing the $h$-range of the postage stamp problem

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, and to find a lower bound for the extremal 2-range.