Artículo
The path-variance problem on tree networks
Autor/es | Cáceres Sansaloni, María Teresa
López de los Mozos Martín, María Cruz Mesa López-Colmenar, Juan Antonio |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI) |
Fecha de publicación | 2004 |
Fecha de depósito | 2019-10-24 |
Publicado en |
|
Resumen | Extensive facility location models on graphs deal with the location of a special type of subgraphs such as paths, trees
or cycles and can be considered as extensions of classical point location models. Variance is one of ... Extensive facility location models on graphs deal with the location of a special type of subgraphs such as paths, trees or cycles and can be considered as extensions of classical point location models. Variance is one of the measures applied in models in which some equality requirement is imposed. In this paper the problem of locating a minimum variance path in a tree network is addressed, and an O(n2 log n) time algorithm is proposed. |
Identificador del proyecto | BFM2000-1052-C02-01 |
Cita | Cáceres Sansaloni, M.T., López de los Mozos Martín, M.C. y Mesa López-Colmenar, J.A. (2004). The path-variance problem on tree networks. Discrete Applied Mathematics, 145 (1), 72-79. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
The path-variance problem.pdf | 291.3Kb | [PDF] | Ver/ | |