Artículo
Multifacility ordered median problems on networks: a further analysis
Autor/es | Jörg Kalcsics, Stefan Nickel
Puerto Albandoz, Justo |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2003 |
Fecha de depósito | 2015-06-23 |
Publicado en |
|
Resumen | In this paper, we address the ordered p-median problem, which includes as special cases most of the classical multifacility location problems discussed in the literature. Finite dominating sets (FDS) are known for particular ... In this paper, we address the ordered p-median problem, which includes as special cases most of the classical multifacility location problems discussed in the literature. Finite dominating sets (FDS) are known for particular instances of this problem: p-median, p-center, and p-centdian. We find an FDS for the ordered p-median problem. This set allows us to gain a better insight into the general FDS structure of network location problems. This FDS is later used to present the first polynomial time algorithm for p-facility ordered median problems on tree networks. |
Cita | Jörg Kalcsics, S.N. y Puerto Albandoz, J. (2003). Multifacility Ordered Median Problems On Networks: a Further Analysis.. Networks, 41 (1), 1-12. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
file_1.pdf | 305.7Kb | [PDF] | Ver/ | |