Locating a facility on a network with multiple median-type objectives
| dc.contributor.author | Ramos Domínguez, Rosa María | |
| dc.contributor.author | Ramos, M.T. | |
| dc.contributor.author | Colebrook, M. | |
| dc.contributor.author | Sicilia, J. | |
| dc.date.accessioned | 2023-06-20T17:06:42Z | |
| dc.date.available | 2023-06-20T17:06:42Z | |
| dc.date.issued | 1999 | |
| dc.description.abstract | We 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.department | Depto. de Estadística e Investigación Operativa | |
| dc.description.faculty | Fac. de Ciencias Matemáticas | |
| dc.description.refereed | TRUE | |
| dc.description.sponsorship | Dirección General de Universidades e Investigación of the Canary Islands Government, Spain. | |
| dc.description.status | pub | |
| dc.eprint.id | https://eprints.ucm.es/id/eprint/17601 | |
| dc.identifier.doi | 10.1023/A:1018902701712 | |
| dc.identifier.issn | 0254-5330 | |
| dc.identifier.officialurl | http://link.springer.com/content/pdf/10.1023%2FA%3A1018902701712 | |
| dc.identifier.relatedurl | http://link.springer.com/ | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14352/57788 | |
| dc.journal.title | Annals of Operations Research | |
| dc.language.iso | eng | |
| dc.page.final | 235 | |
| dc.page.initial | 221 | |
| dc.publisher | Springer | |
| dc.relation.projectID | Project Number 93 /108 | |
| dc.rights.accessRights | restricted access | |
| dc.subject.cdu | 519.8 | |
| dc.subject.keyword | 1-median problem | |
| dc.subject.keyword | Location analysis | |
| dc.subject.keyword | Network optimization | |
| dc.subject.ucm | Investigación operativa (Matemáticas) | |
| dc.subject.unesco | 1207 Investigación Operativa | |
| dc.title | Locating a facility on a network with multiple median-type objectives | |
| dc.type | journal article | |
| dc.volume.number | 86 | |
| dcterms.references | S.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. | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | bf1332c5-1ade-4e50-9bd5-c46a938d2344 | |
| relation.isAuthorOfPublication.latestForDiscovery | bf1332c5-1ade-4e50-9bd5-c46a938d2344 |
Download
Original bundle
1 - 1 of 1