Abstract
This paper introduces an exact procedure to solve a class of locational problems where there is a catalogue of available sites to choose from; economies of scale and capacity restrictions are prevailing at each site. The procedure was applied to the problem of siting central sterile supply departments and the computational experience is reported. The applicability of the procedure to similar applications and the treatment of the dynamic facility location problem are discussed.