A note on the minmax regret centdian location on trees

Authors:
Eduardo Conde
Affiliations:
Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Universidad de Sevilla, Campus Universitario de Reina Mercedes, 41012 Sevilla, Spain
Venue:
Operations Research Letters
Year:
2008

Citing 0
Cited 2

Minimax Regret Single-Facility Ordered Median Location Problems on Networks

INFORMS Journal on Computing
Robust mean absolute deviation problems on networks with linear vertex weights

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minmax regret optimization model of the doubly weighted centdian location on trees is considered. Assuming that both types of weights, demands and relative importance of the customers, are partially known through interval estimates, an exact algorithm of complexity O(n^3logn) is derived. This bound is improved in some special cases.