Optimal Locations for Centers in a Network

The problem treated is that of locating n centers (processing facilities) in a network, so as to minimize the total transportation cost associated with their use. On the assumption that all movements occur between a vertex and a center nearest it, Hakimi has shown that only vertex locations for the centers need be considered. The present paper shows that this conclusion remains valid under alternative assumptions more appropriate for some applications.