A. Altin, E. Amaldi, P. Belotti, and M. C. Pinar, Virtual Private Network Design Under Traffic Uncertainty, Electronic Notes in Discrete Mathematics, vol.17, pp.19-22, 2004.
DOI : 10.1016/j.endm.2004.03.007

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

A. Altin, H. Yaman, and M. Pinar, A hybrid polyhedral uncertainty model for the robust network loading problem Performance models and risk management in communications systems, pp.157-172, 2011.

A. Altin, H. Yaman, and M. 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

D. Applegate and E. Cohen, Making intra-domain routing robust to changing and uncertain traffic demands, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications , SIGCOMM '03, pp.313-324, 2003.
DOI : 10.1145/863955.863991

A. Atamturk, On capacitated network design cut?set polyhedra, Mathematical Programming, vol.92, issue.3, pp.425-437, 2002.
DOI : 10.1007/s101070100284

F. Babonneau, O. Klopfenstein, A. Ouorou, and J. P. Vial, Robust capacity expansion solutions for telecommunication networks with uncertain demands, Networks (submitted, available as Optimization Online preprint 2712

W. Ben-ameur, Between fully dynamic routing and robust stable routing, 2007 6th International Workshop on Design and Reliable Communication Networks, pp.1-6, 2007.
DOI : 10.1109/DRCN.2007.4762277

W. Ben-ameur and H. Kerivin, Networks new economical virtual private, Communications of the ACM, vol.46, issue.6, pp.69-73, 2003.
DOI : 10.1145/777313.777314

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

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

A. Ben-tal and A. Nemirovski, Robust solutions of Linear Programming problems contaminated with uncertain data, Mathematical Programming, vol.88, issue.3, pp.411-424, 2000.
DOI : 10.1007/PL00011380

A. Ben-tal and A. Nemirovski, Robust optimization ? methodology and applications, Mathematical Programming, vol.92, issue.3, pp.453-480, 2002.
DOI : 10.1007/s101070100286
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.8364

J. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol.38, issue.1, pp.238-252, 1962.
DOI : 10.1007/BF01386316

D. Bertsimas and V. Goyal, On the power and limitations of affine policies in two-stage adaptive optimization Online First), Math Program, 2011.

D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Mathematical Programming, vol.98, issue.1-3, pp.49-71, 2003.
DOI : 10.1007/s10107-003-0396-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.1682

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

D. Bienstock and O. Günlück, Capacitated Network Design???Polyhedral Structure and Computation, INFORMS Journal on Computing, vol.8, issue.3, pp.243-259, 1996.
DOI : 10.1287/ijoc.8.3.243

A. Bley, R. Klaehne, U. Menne, C. Raack, and R. Wessaely, Multi-layer network design ? A model-based optimization approach, Proc PGTS, pp.107-116, 2008.

C. Chekuri, Routing and network design with robustness to changing or uncertain traffic demands, ACM SIGACT News, vol.38, issue.3, pp.106-129, 2007.
DOI : 10.1145/1324215.1324236

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

X. Chen and Y. Zhang, Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts, Operations Research, vol.57, issue.6, pp.1469-1482, 2009.
DOI : 10.1287/opre.1080.0605

A. M. Costa, A survey on benders decomposition applied to fixed-charge network design problems, Computers & Operations Research, vol.32, issue.6, pp.1429-1450, 2005.
DOI : 10.1016/j.cor.2003.11.012

G. Dahl and M. Stoer, A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems, INFORMS Journal on Computing, vol.10, issue.1, pp.1-11, 1998.
DOI : 10.1287/ijoc.10.1.1

N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan et al., A flexible model for resource management in virtual private networks, SIGCOMM Comput. Commun. Rev, pp.29-95, 1999.

A. Dwivedi and R. E. Wagner, Traffic model for USA long-distance optical network, Optical Fiber Communication Conference. Technical Digest Postconference Edition. Trends in Optics and Photonics Vol.37 (IEEE Cat. No. 00CH37079), pp.156-158, 2000.
DOI : 10.1109/OFC.2000.868400

A. Frangioni and B. Gendron, 0???1 reformulations of the multicommodity capacitated network design problem, Discrete Applied Mathematics, vol.157, issue.6, pp.1229-1241, 2009.
DOI : 10.1016/j.dam.2008.04.022

A. Frangioni, F. Pascali, and M. G. , Static and dynamic routing under disjoint dominant extreme demands, Operations Research Letters, vol.39, issue.1, pp.36-39, 2011.
DOI : 10.1016/j.orl.2010.11.009

N. Goyal, N. Olver, and F. B. Shepherd, Dynamic vs. oblivious routing in network design, 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

M. Iri, On an extension of the maximum-flow minimum-cut theorem to multicommodity flows, J Oper Res Soc Jpn, vol.13, pp.129-135, 1971.

T. Koch, Zimpl user guide, 2001.

A. M. Koster, M. Kutschka, and C. Raack, Cutset Inequalities for Robust Network Design, Proc 5th Int Network Optim Conference, pp.118-123, 2011.
DOI : 10.1007/978-3-642-21527-8_15

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

A. Lisser, A. Ouorou, J. P. Vial, and J. Gondzio, Capacity planning under uncertain demand in telecommunication networks, 1999.

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

S. Mudchanatongsuk, F. Ordonez, and J. Liu, Robust solutions for network design under transportation cost and demand uncertainty, Journal of the Operational Research Society, vol.36, issue.5, pp.552-562, 2008.
DOI : 10.1080/07408170490257835

K. Onaga and O. Kakusho, On feasibility conditions of multicommodity flows in networks, IEEE Transactions on Circuit Theory, vol.18, issue.4, pp.425-429, 1971.
DOI : 10.1109/TCT.1971.1083312

F. Ordóñez and J. Zhao, Robust capacity expansion of network flows, pp.136-145, 2007.

G. Oriolo, Domination Between Traffic Matrices, Mathematics of Operations Research, vol.33, issue.1, pp.91-96, 2008.
DOI : 10.1287/moor.1070.0280

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

A. Ouorou, Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications, Proc 5th Int Network Optim Conference, pp.277-282, 2011.
DOI : 10.1007/978-3-642-21527-8_32

A. Ouorou and J. P. 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, Proc 5th Int Network Optim Conference, pp.150-155, 2011.
DOI : 10.1007/978-3-642-21527-8_19
URL : https://hal.archives-ouvertes.fr/hal-00916978

C. Raack, A. M. Koster, S. Orlowski, and R. Wessäly, On cut-based inequalities for capacitated network design polyhedra, Networks, vol.14, pp.141-156, 2011.
DOI : 10.1002/net.20395

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

Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, Fast accurate computation of largescale IP traffic matrices from link loads, Proc ACM SIGMETRICS, pp.206-217, 2003.