AbstractThe general location-allocation problem is identified and discussed. The hierarchical extension of this problem is then shown to be of especial interest. A computational algorithm for heuristic solution of the hierarchical problem is described. This algorithm appears to yield solutions of high quality. Finally a numerical problem is examined.