C. Agiakloglou and D. Yannelis, Estimation of Price Elasticities for International Telecommunications Demand, International Advances in Economic Research, vol.39, issue.1, pp.131-137, 2006.
DOI : 10.1007/s11294-005-2279-3

A. Altin, H. Yaman, and M. C. Pinar, The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations, INFORMS Journal on Computing, vol.23, issue.1, pp.75-89, 2011.
DOI : 10.1287/ijoc.1100.0380

R. Andrade, A. Lisser, N. Maculan, and G. Plateau, Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models, Management Science, vol.52, issue.9, pp.1450-1455, 2006.
DOI : 10.1287/mnsc.1060.0536

F. Babonneau, O. Klopfenstein, A. Ouorou, and J. Vial, Robust capacity expansion solutions for telecommunication networks with uncertain demands, 2013.

A. Ben-tal, L. Ghaoui, and A. S. Nemirovski, Robust optimization, 2009.
DOI : 10.1515/9781400831050

A. Ben-tal, A. Goryashko, E. Guslitzer, and A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Mathematical Programming, vol.99, issue.2, pp.351-376, 2004.
DOI : 10.1007/s10107-003-0454-y

A. Ben-tal, A. Nemirovski, and C. Roos, Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems, SIAM Journal on Optimization, vol.13, issue.2, pp.535-560, 2002.
DOI : 10.1137/S1052623401392354

D. Bertsimas, D. B. Brown, and C. Caramanis, Theory and Applications of Robust Optimization, SIAM Review, vol.53, issue.3, pp.464-501, 2011.
DOI : 10.1137/080734510

D. Bertsimas, I. Dunning, and M. Lubin, Reformulation versus cutting-planes for robust optimization, Computational Management Science, vol.4, issue.3, 2014.
DOI : 10.1007/s10287-015-0236-z

D. Bertsimas and M. Sim, The Price of Robustness, Operations Research, vol.52, issue.1, pp.35-53, 2004.
DOI : 10.1287/opre.1030.0065

B. Borchers, CSDP 2.3 user's guide, Optimization Methods and Software, vol.11, issue.1-4, pp.597-611, 1999.
DOI : 10.1080/10556789908805764

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Mathematical Programming, vol.91, issue.2, pp.201-213, 2002.
DOI : 10.1007/s101070100263

M. Fischetti and M. Monaci, Cutting plane versus compact formulations for uncertain (integer) linear programs, Mathematical Programming Computation, vol.21, issue.3, pp.239-273, 2012.
DOI : 10.1007/s12532-012-0039-y

C. Garbacz and H. G. Thompson-jr, Demand for telecommunication services in developing countries, Telecommunications Policy, vol.31, issue.5, pp.276-289, 2007.
DOI : 10.1016/j.telpol.2007.03.007

S. J. Garstka, Stochastic Programs with Recourse: Random Recourse Costs Only, Management Science, vol.19, issue.7, pp.747-762, 1973.
DOI : 10.1287/mnsc.19.7.747

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 1993.

J. Kelley and J. E. , The Cutting-Plane Method for Solving Convex Programs, Journal of the Society for Industrial and Applied Mathematics, vol.8, issue.4, pp.703-712, 1960.
DOI : 10.1137/0108053

A. M. Koster, M. Kutschka, and C. Raack, Robust network design: Formulations, valid inequalities, and computations, Networks, vol.36, issue.2, pp.128-149, 2013.
DOI : 10.1002/net.21497
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.2593

V. Kreinovich, A. Neumaier, and G. Xiang, Towards a combination of interval and ellipsoid uncertainty, Computational Technologies, vol.13, issue.6, pp.5-16, 2008.

C. Lee, K. Lee, K. Park, and S. Park, Technical Note???Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations, Operations Research, vol.60, issue.3, pp.604-610, 2012.
DOI : 10.1287/opre.1120.1049

C. Lemaréchal, A. Ouorou, and G. Petrou, Robust network design in telecommunications under polytope demand uncertainty, European Journal of Operational Research, vol.206, issue.3, pp.634-641, 2010.
DOI : 10.1016/j.ejor.2010.03.007

T. Matsui, NP-hardness of linear multiplicative programming and related problems, Journal of Global Optimization, vol.24, issue.2, pp.113-119, 1996.
DOI : 10.1007/BF00121658

S. Mattia, The robust network loading problem with dynamic routing, Computational Optimization and Applications, vol.57, issue.2, pp.619-643, 2013.
DOI : 10.1007/s10589-012-9500-0

M. Monaci, U. Pferschy, and P. Serafini, Exact solution of the robust knapsack problem, Computers & Operations Research, vol.40, issue.11, pp.2625-2631, 2013.
DOI : 10.1016/j.cor.2013.05.005

S. Orlowski, M. Pióro, A. Tomaszewski, and R. Wessäly, SNDlib 1.0-Survivable Network Design Library, Networks, vol.3, issue.3, pp.276-286, 2010.
DOI : 10.1002/net.20371

A. Ouorou, Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty, Computers & Operations Research, vol.40, issue.1, pp.318-327, 2013.
DOI : 10.1016/j.cor.2012.07.001

A. Ouorou, P. Mahey, and J. Vial, A Survey of Algorithms for Convex Multicommodity Flow Problems, Management Science, vol.46, issue.1, pp.126-147, 2000.
DOI : 10.1287/mnsc.46.1.126.15132

A. Ouorou and J. Vial, A model for robust capacity planning for telecommunications networks under demand uncertainty, 2007 6th International Workshop on Design and Reliable Communication Networks, pp.1-4, 2007.
DOI : 10.1109/DRCN.2007.4762287

I. Pólik and T. Terlaky, A Survey of the S-Lemma, SIAM Review, vol.49, issue.3, pp.371-418, 2007.
DOI : 10.1137/S003614450444614X

M. Poss, Robust combinatorial optimization with variable budgeted uncertainty, 4OR, vol.59, issue.1, pp.75-92, 2013.
DOI : 10.1007/s10288-012-0217-9
URL : https://hal.archives-ouvertes.fr/hal-00916975

M. Poss, A comparison of routing sets for robust network design, Optimization Letters, vol.21, issue.3, pp.1619-1635
DOI : 10.1007/s11590-013-0679-5
URL : https://hal.archives-ouvertes.fr/hal-01099565

M. Poss, Robust combinatorial optimization with variable cost uncertainty, European Journal of Operational Research, vol.237, issue.3, pp.836-845, 2014.
DOI : 10.1016/j.ejor.2014.02.060
URL : https://hal.archives-ouvertes.fr/hal-01099569

M. Poss and C. Raack, Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing, Networks, vol.61, issue.2, pp.180-198, 2013.
DOI : 10.1007/978-3-642-21527-8_19
URL : https://hal.archives-ouvertes.fr/hal-00916978

S. Sen, R. D. Doverspike, and S. Cosares, Network planning with random demand, Telecommunication Systems, vol.17, issue.1, pp.11-30, 1994.
DOI : 10.1007/BF02110042