Robust mean absolute deviation problems on networks with linear vertex weights

Authors:
M.C. López-de-los-Mozos;J. Puerto;A.M. Rodríguez-Chía
Affiliations:
Departamento de Matemática Aplicada I. Universidad de Sevilla, Spain;Departamento de Estadística e Investigación Operativa. Universidad de Sevilla, Spain;Departamento de Estadística e Investigación Operativa. Universidad de Sevilla, Spain
Venue:
Networks
Year:
2013

Citing 11
Cited 0

Arrangements of lines in 3-space: a data structure with applications

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Arrangements of curves in the plane—topology, combinatorics, and algorithms

Theoretical Computer Science
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Minmax Regret Median Location on a Network Under Uncertainty

INFORMS Journal on Computing
Complexity of robust single facility location problems on networks with uncertain edge lengths

Discrete Applied Mathematics
Improved algorithms for several network location problems with equality measures

Discrete Applied Mathematics
Interval data minmax regret network optimization problems

Discrete Applied Mathematics
The Minmax Relative Regret Median Problem on Networks

INFORMS Journal on Computing
Minimax Regret Single-Facility Ordered Median Location Problems on Networks

INFORMS Journal on Computing
Minimax regret path location on trees

Networks
A note on the minmax regret centdian location on trees

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. © 2012 Wiley Periodicals, Inc. NETWORKS, 2013 © 2013 Wiley Periodicals, Inc.