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

dc.contributor.authorRamos Domínguez, Rosa María
dc.contributor.authorRamos, M.T.
dc.contributor.authorColebrook, M.
dc.contributor.authorSicilia, J.
dc.date.accessioned2023-06-20T17:06:42Z
dc.date.available2023-06-20T17:06:42Z
dc.date.issued1999
dc.description.abstractWe 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 facility
dc.description.departmentDepto. de Estadística e Investigación Operativa
dc.description.facultyFac. de Ciencias Matemáticas
dc.description.refereedTRUE
dc.description.sponsorshipDirección General de Universidades e Investigación of the Canary Islands Government, Spain.
dc.description.statuspub
dc.eprint.idhttps://eprints.ucm.es/id/eprint/17601
dc.identifier.citationS.L. Hakimi, Optimal locations switching centers and the absolute centers and medians of a graph, Operations Research 12(1964)450-459. G. Handler and P. Mirchandani, Locations on Networks, MIT Press, 1979. P. Harvinen, T. Rajala and K. Sinerva, A branch and bound algorithm for seeking the p-median, Operations Research 20(1972)173-178. O. Kariv and S.L. Hakimi, Optimum distribution of switching centers in a communication network and some related graph-theoretic problems, Operations Research 13(1965)462-475. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems. II: The p-medians, SIAM Journal of Applied Mathematics 37(1979)539-560. P.B. Mirchandani and R.L. Francis, Discrete Location Theory, Wiley Interscience, 1990. S.C. Narula, U.L. Ogbu and H.M. Samuelsson, An algorithm for the p-median problem, Operations Research 25(1977)709-712. A. Oudjit, Mediam locations on deterministic and probabilistic multidimensional networks, Ph.D. Dissertation, Rensselaer Polytechnic Institute, Troy, NY, 1981. S. Singer, Multi-centers and multimedians of a graph with an application to optimal warehouse location, Operations Research 16(1968) B-87-88.
dc.identifier.doi10.1023/A:1018902701712
dc.identifier.issn0254-5330
dc.identifier.officialurlhttp://link.springer.com/content/pdf/10.1023%2FA%3A1018902701712
dc.identifier.relatedurlhttp://link.springer.com/
dc.identifier.urihttps://hdl.handle.net/20.500.14352/57788
dc.journal.titleAnnals of Operations Research
dc.language.isoeng
dc.page.final235
dc.page.initial221
dc.publisherSpringer
dc.relation.projectIDProject Number 93 /108
dc.rights.accessRightsrestricted access
dc.subject.cdu519.8
dc.subject.keyword1-median problem
dc.subject.keywordLocation analysis
dc.subject.keywordNetwork optimization
dc.subject.ucmInvestigación operativa (Matemáticas)
dc.subject.unesco1207 Investigación Operativa
dc.titleLocating a facility on a network with multiple median-type objectives
dc.typejournal article
dc.volume.number86
dspace.entity.typePublication
relation.isAuthorOfPublicationbf1332c5-1ade-4e50-9bd5-c46a938d2344
relation.isAuthorOfPublication.latestForDiscoverybf1332c5-1ade-4e50-9bd5-c46a938d2344
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
RamosDom01.pdf
Size:
195.18 KB
Format:
Adobe Portable Document Format
Collections