Locating a facility on a network with multiple median-type objectives

We consider the problem of locating a single facility on a network in the p resence of r greater than or equal to 2 median-type objectives, represented by r sets of edge weights (or lengths) corresponding to each of the object ives. When r = 1, then one gets the classical 1-median problem where only t he vertices need to be considered for determining the optimal location (Hak imi [1]). The paper examines the case when r greater than or equal to 2 and provides a method to determine the non-dominated set of points for locatin g the facility.