Repositorio de producción científica de la Universidad de Sevilla

Multifacility ordered median problems on networks: a further analysis

 

Advanced Search
 
Opened Access Multifacility ordered median problems on networks: a further analysis
Cites

Show item statistics
Icon
Export to
Author: Jörg Kalcsics, Stefan Nickel
Puerto Albandoz, Justo
Department: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Date: 2003
Published in: Networks, 41(1), 1-12
Document type: Article
Abstract: 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.
Cite: Jörg Kalcsics, S.N. y Puerto Albandoz, J. (2003). Multifacility Ordered Median Problems On Networks: a Further Analysis.. Networks, 41 (1), 1-12.
Size: 305.7Kb
Format: PDF

URI: http://hdl.handle.net/11441/25959

DOI: 10.1002/net.10053

See editor´s version

This work is under a Creative Commons License: 
Atribución-NoComercial-SinDerivadas 4.0 España

This item appears in the following Collection(s)