Artículo
Robust mean absolute deviation problems on networks with linear vertex weights
Autor/es | López de los Mozos Martín, María Cruz
Puerto Albandoz, Justo Rodríguez Chía, Antonio Manuel |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2013 |
Fecha de depósito | 2019-10-28 |
Publicado en |
|
Resumen | This article deals with incorporating the mean absolute
deviation objective function in several robust single facility
location models on networks with dynamic evolution
of node weights, which are modeled by means of ... This article deals with incorporating the mean absolute deviation objective function in several robust single facility location models on networks with dynamic evolution of node weights, which are modeled by means of linear functions of a parameter. Specifically, we have considered two robustness criteria applied to the mean absolute deviation problem: the MinMax criterion, and the MinMax regret criterion. For solving the corresponding optimization problems, exact algorithms have been proposed and their complexities have been also analyzed. |
Identificador del proyecto | MTM2007-67433-C02-(01,02)
MTM2009-14243 MTM2010-19576-C02-(01,02) DE2009-0057 P09-TEP-5022 FQM-5849 |
Cita | López de los Mozos Martín, M.C., Puerto Albandoz, J. y Rodríguez Chía, A.M. (2013). Robust mean absolute deviation problems on networks with linear vertex weights. Networks: an International Journal, 61 (1), 76-85. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Robust mean absolute deviation ... | 1.067Mb | [PDF] | Ver/ | |