Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Aloulou, M. A., Kalai, R., & Vanderpooten, D. (2005). Minmax regret 1-center problem on a network with a discrete set of scenarios. Cahiers de recherche en ligne du LAMSADE-Document, (132).
2. Averbakh, I. (2003). Complexity of robust single facility location problems on networks with uncertain edge lengths. Discrete Applied Mathematics, 127(3), 505–522.
3. Averbakh, I., & Berman, O. (2000). Algorithms for the robust $$ 1 $$-center problem on a tree. European Journal of Operational Research, 123(2), 92–302.
4. Averbakh, I., & Berman, O. (2000). Minmax regret median location on a network under uncertainty. INFORMS Journal on Computing, 12(2), 104–110.
5. Averbakh, I., & Berman, O. (2003). An improved algorithm for the minmax regret median problem on tree. Networks, 41, 97–103.