Thumbnail

Minmax regret 1-center problem on a network with a discrete set of scenarios

Kalaï, Rim; Aloulou, Mohamed Ali; Vallin, Philippe; Vanderpooten, Daniel (2006), Minmax regret 1-center problem on a network with a discrete set of scenarios. https://basepub.dauphine.fr/handle/123456789/4529

View/Open
Type
Document de travail / Working paper
Date
2006
Publisher
Université Paris-Dauphine
Series title
Cahier du LAMSADE
Series number
132
Published in
Paris
Pages
13
Metadata
Show full item record
Author(s)
Kalaï, Rim
Aloulou, Mohamed Ali
Vallin, Philippe
Vanderpooten, Daniel
Abstract (EN)
We consider the minmax regret 1-center problem on a general network with uncertainty on demands. Unlike other papers which considered the problem under interval uncertainty, we assume here that demand uncertainty is modelled by a finite number of discrete scenarios. We develop a solution approach based on the decomposition of the network into basic intervals and present a polynomial algorithm for the problem. Finally, we illustrate our approach with an example.
Subjects / Keywords
1-center location problem; Uncertainty modelling; Robustness