A. Altin, E. Amaldi, P. Belotti, and M. C. Pinar, Provisioning virtual private networks under traffic uncertainty, Networks, vol.21, issue.1, pp.100-115, 2007.
DOI : 10.1002/net.20145

W. Ben-ameur and H. Kerivin, Routing of uncertain demands, Optimization and Engineering, vol.3, pp.283-313, 2005.

W. Ben-ameur and M. Zotkiewicz, Volume oriented routing, 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS), pp.1-7, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00807292

W. Ben-ameur and M. Zotkiewicz, Robust routing and optimal partitioning of a traffic demand polytope, International Transactions in Operational Research, vol.11, issue.4, pp.307-333, 2011.
DOI : 10.1111/j.1475-3995.2010.00764.x
URL : https://hal.archives-ouvertes.fr/hal-00678809

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

A. Ben-tal and A. Nemirovski, Robust solutions of uncertain linear programs, Operations Research Letters, vol.25, issue.1, pp.1-13, 1999.
DOI : 10.1016/S0167-6377(99)00016-4

D. Bertsimas and C. Caramanis, Finite adaptability in multistage linear optimization. Automatic Control, IEEE Transactions on, vol.55, issue.12, pp.2751-2766, 2010.

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

C. Chekuri, G. Oriolo, M. G. Scutelì, and F. B. Shepherd, Hardness of robust network design, Networks, vol.46, issue.1, pp.50-54, 2007.
DOI : 10.1002/net.20165

N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan et al., A flexible model for resource management in virtual private networks, ACM SIGCOMM Computer Communication Review, vol.29, issue.4, pp.95-108, 1999.
DOI : 10.1145/316194.316209

J. A. Fingerhut, S. Suri, and J. S. Turner, Designing Least-Cost Nonblocking Broadband Networks, Journal of Algorithms, vol.24, issue.2, pp.287-309, 1997.
DOI : 10.1006/jagm.1997.0866
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.5873

N. Goyal, N. Olver, and F. B. Shepherd, Dynamic vs. oblivious routing in network design, Proceedings of the ESA 2009, pp.277-288, 2009.

A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener, Provisioning a virtual private network, Proceedings of the thirty-third annual ACM symposium on Theory of computing , STOC '01, pp.389-398, 2001.
DOI : 10.1145/380752.380830

A. M. Koster, M. Kutschka, and C. Raack, Robust network design: Formulations, valid inequalities, and computations, Networks, vol.36, issue.2, 2011.
DOI : 10.1002/net.21497

M. Minoux, Robust network optimization under polyhedral demand uncertainty is <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:math>-hard, Discrete Applied Mathematics, vol.158, issue.5, pp.597-603, 2010.
DOI : 10.1016/j.dam.2009.09.025

F. Ordóñez and J. Zhao, Robust capacity expansion of network flows, Networks, vol.36, issue.2, pp.136-145, 2007.
DOI : 10.1002/net.20183

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 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

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

A. L. Soyster, Technical Note???Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research, vol.21, issue.5, pp.1154-1157, 1973.
DOI : 10.1287/opre.21.5.1154