Thumbnail

Robust 1-median location problem on a tree

Aloulou, Mohamed Ali; Kalaï, Rim; Vallin, Philippe; Vanderpooten, Daniel (2005), Robust 1-median location problem on a tree, Operational Research Peripatetic Postgraduate Programme (ORP3 2005), Valence, SPAIN

View/Open
Type
Communication / Conférence
Date
2005
Conference title
Operational Research Peripatetic Postgraduate Programme (ORP3 2005)
Conference city
Valence
Conference country
SPAIN
Metadata
Show full item record
Author(s)
Aloulou, Mohamed Ali
Kalaï, Rim
Vallin, Philippe
Vanderpooten, Daniel
Abstract (EN)
In combinatorial optimization, and partic-ularly in location problems, the most used robustnesscriteria rely either on maximal cost or on maximal regret.However, it is well known that these criteria are tooconservative. In this paper, we present a new robustnessapproach, called lexicographic α-robustness, which com-pensates for the drawbacks of the criteria based on theworst case. We apply this notion to the 1-median locationproblem under uncertainty and we give a polynomialalgorithm to determine robust solutions in the case of atree graph.
Subjects / Keywords
1-median location problem; scenario-based uncertainty; Robustness; minmax cost/regret