Ramos Domínguez, Rosa MaríaRamos, M.T.Colebrook, M.Sicilia, J.2023-06-202023-06-2019990254-533010.1023/A:1018902701712https://hdl.handle.net/20.500.14352/57788We consider the problem of locating a single facility on a network in the presence 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 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 greater than or equal to 2 and provides a method to determine the non-dominated set of points for locating the facilityengjournal articlehttp://link.springer.com/content/pdf/10.1023%2FA%3A1018902701712http://link.springer.com/restricted access519.81-median problemLocation analysisNetwork optimizationInvestigación operativa (Matemáticas)1207 Investigación Operativa