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 presence of r ≥ 2 median-type objectives, represented by r sets of edge weights (or lengths) corresponding to each of the objectives. When r = 1, then one gets the classical 1-median problem where only the vertices need to be considered for determining the optimal location (Hakimi [1]). The paper examines the case when r ≥ 2 and provides a method to determine the non-dominated set of points for locating the facility.