R. V. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows : Theory, Algorithms and Applications, 1993.

A. Atamtürk, Strong Formulations of Robust Mixed 0???1 Programming, Mathematical Programming, vol.98, issue.2-3, pp.235-250, 2006.
DOI : 10.1007/s10107-006-0709-5

F. Babonneau, J. Ph, and . Vial, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, Mathematical Programming, 2007.

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 traffic demands. Optimization and engineering, pp.283-313, 2005.

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 Convex Optimization, Mathematics of Operations Research, vol.23, issue.4, 1998.
DOI : 10.1287/moor.23.4.769

A. Ben-tal and A. Nemirovski, Robust solutions of uncertain linear programs. Operation Research Letters, pp.1-13, 1999.

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

A. Ben-tal and A. Nemirovski, Robust optimization -methodology and appliacations, Mathematical Programming, pp.453-480, 2002.

J. F. 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 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

O. Briant, C. Lemaréchal, . Ph, S. Meurdesoif, N. Michel et al., Comparison of bundle and classical column generation, Mathematical Programming, pp.299-344, 2008.
DOI : 10.1007/s10107-006-0079-z
URL : https://hal.archives-ouvertes.fr/inria-00070554

E. Cheney and A. Goldstein, Newton's method for convex programming and Tchebycheff approximation, Numerische Mathematik, vol.8, issue.1, pp.253-268, 1959.
DOI : 10.1007/BF01386389

A. V. Demyanov, V. F. Demyanov, and V. N. Malozemov, Minimaxmin problems revisited. Optimization Methods and Software, pp.783-804, 2002.

N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan et al., Resource management with hoses: point-to-cloud services for virtual private networks, IEEE/ACM Transactions on Networking, vol.10, issue.5, pp.679-692, 2002.
DOI : 10.1109/TNET.2002.803918

N. G. Duffield, P. Goyal, A. G. Greenberg, P. P. Mishra, K. K. Ramakrishnan et al., A flexible model for resource management in virtual private networks, Proceedings of SIGCOMM '99, pp.95-108, 1999.

O. Ekin-kara¸sankara¸san, M. C. Pinar, and H. Yaman, The robust shortest path problem with interval data, 2001.

J. Elzinga and T. J. Moore, A central cutting plane algorithm for the convex programming problem, Mathematical Programming, vol.4, issue.1, pp.134-145, 1975.
DOI : 10.1007/BF01580439

T. Erlebach and M. Ruegg, Optimal bandwidth reservation in hose-model VPNs with multipath routing, Proceedings of INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, pp.2275-2282, 2004.

J. E. Falk and R. M. Soland, An Algorithm for Separable Nonconvex Programming Problems, Management Science, vol.15, issue.9, pp.550-569, 1969.
DOI : 10.1287/mnsc.15.9.550

N. Geary, A. Antonopoulos, E. Drakopoulos, J. J. Reilly, and J. E. Mitchell, A framework for optical network planning under traffic uncertainty, Proceedings of 3rd International Workshop on the Design of Reliable Communication Networks (DRCN), 2001.

L. Ghaoui and H. Lebret, Robust Solutions to Least-Squares Problems with Uncertain Data, SIAM Journal on Matrix Analysis and Applications, vol.18, issue.4, pp.1035-1064, 1997.
DOI : 10.1137/S0895479896298130

L. Ghaoui, F. Oustry, and H. Lebret, Robust Solutions to Uncertain Semidefinite Programs, SIAM Journal on Optimization, vol.9, issue.1, pp.33-52, 1998.
DOI : 10.1137/S1052623496305717

J. Goffin, A. Haurie, and J. Vial, Decomposition and Nondifferentiable Optimization with the Projective Algorithm, Management Science, vol.38, issue.2, pp.284-302, 1992.
DOI : 10.1287/mnsc.38.2.284

O. Günlük, A New Min???Cut Max???Flow Ratio for Multicommodity Flows, SIAM Journal on Discrete Mathematics, vol.21, issue.1, pp.1-15, 2007.
DOI : 10.1137/S089548010138917X

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

J. L. Higle and S. Sen, Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse, Mathematics of Operations Research, vol.16, issue.3, pp.650-669, 1991.
DOI : 10.1287/moor.16.3.650

J. Hiriart-urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, 1993.
DOI : 10.1007/978-3-662-02796-7

G. F. Italiano, S. Leonardi, and G. Oriolo, Design of networks in the hose model, Proceedings of 2nd International Workshop on Approximation and Randomization Algorithms in Communication Networks, pp.65-76, 2002.

G. F. Italiano, R. Rastogi, and B. Yener, Restoration algorithms for virtual private networks in the hose model, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002.
DOI : 10.1109/INFCOM.2002.1019254

J. E. Kelley, The cutting plane method for solving convex programs, Journal of the SIAM, vol.8, pp.703-712, 1960.

A. Knippel and B. Lardeux, The multi-layered network design problem, European Journal of Operational Research, vol.183, issue.1, pp.87-99, 2007.
DOI : 10.1016/j.ejor.2006.07.046

P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications, 1997.
DOI : 10.1007/978-1-4757-2620-6

A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener, Algorithms for provisioning virtual private networks in the hose model, IEEE/ACM Transactions on Networking, vol.10, issue.4, pp.565-578, 2002.
DOI : 10.1109/TNET.2002.802141

C. Lemaréchal, A. Ouorou, and G. Petrou, A bundle-type algorithm for routing in??telecommunication data networks, Computational Optimization and Applications, vol.1, issue.4, 2008.
DOI : 10.1007/s10589-007-9160-7

A. S. Lewis, Robust regularization, 2002.

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

M. Lucertini and G. Paletta, A class of network design problems with multiple demand: Model formulation and an algorithmic approach, Mathematical Programming Study, vol.26, pp.225-228, 1986.
DOI : 10.1007/BFb0121101

J. M. Mulvey, R. J. Vanderbei, and S. A. Zenios, Robust Optimization of Large-Scale Systems, Operations Research, vol.43, issue.2, pp.264-281, 1995.
DOI : 10.1287/opre.43.2.264

G. L. Nemhauser and W. B. Widhelm, A Modified Linear Program for Columnar Methods in Mathematical Programming, Operations Research, vol.19, issue.4, pp.1051-1060, 1971.
DOI : 10.1287/opre.19.4.1051

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, Networks, vol.36, issue.2, pp.136-145, 2007.
DOI : 10.1002/net.20183

G. Oriolo, Domination Between Traffic Matrices, Mathematics of Operations Research, vol.33, issue.1, 2004.
DOI : 10.1287/moor.1070.0280

A. Ouorou, Robust Capacity Assignment in Telecommunications, Computational Management Science, vol.3, issue.5, pp.285-305, 2006.
DOI : 10.1007/s10287-006-0019-7

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

G. Petrou, C. Lemaréchal, and A. Ouorou, Robust network design in telecommunications under polytope demand uncertainty. under construction, 2006.

G. Petrou, C. Lemaréchal, and A. Ouorou, An approach to robust network design in telecommunications, RAIRO - Operations Research, vol.41, issue.4, pp.411-427, 2007.
DOI : 10.1051/ro:2007033
URL : https://hal.archives-ouvertes.fr/hal-00821340

R. T. Rockafellar, Convex Analysis, 1996.
DOI : 10.1515/9781400873173

A. Schrijver, Theory of Linear and Integer Programming, 1999.

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

P. D. Seymour, Matroids and Multicommodity Flows, European Journal of Combinatorics, vol.2, issue.3, pp.257-290, 1981.
DOI : 10.1016/S0195-6698(81)80033-9
URL : http://doi.org/10.1016/s0195-6698(81)80033-9

F. B. Shepherd and P. J. Winzer, Selective randomized load balancing and mesh networks with changing demands, Journal of Optical Networking, vol.5, issue.5, pp.320-339, 2006.
DOI : 10.1364/JON.5.000320
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.9165

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

A. Takeda, S. Taguchi, and R. H. Tutuncu, Adjustable robust optimization models for nonlinear multi-period optimization, 2004.

S. P. Tarasov, L. G. Khachiyan, and I. I. Erlikh, The method of inscribed ellipsoids, Soviet Mathematics Doklady, vol.37, pp.226-230, 1988.

H. Yaman, O. Ekin-kara¸sankara¸san, and M. C. Pinar, The robust spanning tree problem with interval data, Operations Research Letters, vol.29, issue.1, pp.31-40, 2001.
DOI : 10.1016/S0167-6377(01)00078-5

W. Ben-ameur and H. Kerivin, Routing of Uncertain Traffic Demands, Optimization and Engineering, vol.6, issue.6, pp.283-313, 2005.
DOI : 10.1007/s11081-005-1741-7

A. Ben-tal and A. Nemirovski, Robust Convex Optimization, Mathematics of Operations Research, vol.23, issue.4, 1998.
DOI : 10.1287/moor.23.4.769

M. Bonatti, A. Gaivoronski, A. Lemonche, and P. Polese, Summary of some traffic engineering studies carried out within RACE project R1044, European Transactions on Telecommunications, vol.2, issue.2, pp.79-90, 1994.
DOI : 10.1002/ett.4460050212

A. V. Demyanov, V. F. Demyanov, and V. N. Malozemov, Minmaxmin problems revisited, Optimization Methods and Software, vol.16, issue.5, pp.783-804, 2002.
DOI : 10.1080/1055678021000060810

J. Elzinga and T. J. Moore, A central cutting plane algorithm for the convex programming problem, Mathematical Programming, vol.4, issue.1, pp.134-145, 1975.
DOI : 10.1007/BF01580439

A. Frangioni, Solving semidefinite quadratic problems within nonsmooth optimization algorithms, Computers & Operations Research, vol.23, issue.11, pp.1099-1118, 1996.
DOI : 10.1016/0305-0548(96)00006-8
URL : http://eprints.adm.unipi.it/1926/1/TR%2D95%2D10.ps.gz

J. Goffin, A. Haurie, and J. , Decomposition and Nondifferentiable Optimization with the Projective Algorithm, Management Science, vol.38, issue.2, pp.284-302, 1992.
DOI : 10.1287/mnsc.38.2.284

G. F. Italiano, S. Leonardi, and G. Oriolo, Design of networks in the hose model, 2nd International Workshop on Approximation and Randomization Algorithms in Communication Networks, pp.65-76, 2002.

J. E. Kelley, 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

P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications, 1997.
DOI : 10.1007/978-1-4757-2620-6

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

M. Lucertini and G. Paletta, A class of network design problems with multiple demand: Model formulation and an algorithmic approach, Math. Program. Study, vol.26, pp.225-228, 1986.
DOI : 10.1007/BFb0121101

G. L. Nemhauser and W. B. Widhelm, A Modified Linear Program for Columnar Methods in Mathematical Programming, Operations Research, vol.19, issue.4, pp.1051-1060, 1971.
DOI : 10.1287/opre.19.4.1051

A. Ouorou, Robust Capacity Assignment in Telecommunications, Computational Management Science, vol.3, issue.5, pp.285-305, 2006.
DOI : 10.1007/s10287-006-0019-7

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

E. Cheney and A. Goldstein, Newton's method for convex programming and Tchebycheff approximation, Numerische Mathematik, vol.8, issue.1, pp.253-268, 1959.
DOI : 10.1007/BF01386389
URL : http://www.digizeitschriften.de/download/PPN362160546_0001/PPN362160546_0001___log25.pdf

A. V. Demyanov, V. F. Demyanov, and V. N. Malozemov, Minmaxmin problems revisited. Optimization Methods and Software, pp.783-804, 2002.
DOI : 10.1080/1055678021000060810

J. E. Falk and R. M. Soland, An Algorithm for Separable Nonconvex Programming Problems, Management Science, vol.15, issue.9, pp.550-569, 1969.
DOI : 10.1287/mnsc.15.9.550

J. Hiriart-urruty and C. Lemaréchal, Fundamentals of Convex Analysis, 2001.
DOI : 10.1007/978-3-642-56468-0

R. Horst and H. Tuy, Global optimization. Deterministic approaches, 1996.

J. E. Kelley, The cutting plane method for solving convex programs, Journal of the SIAM, vol.8, pp.703-712, 1960.

G. Petrou, C. Lemaréchal, and A. Ouorou, An approach to robust network design in telecommunications, RAIRO - Operations Research, vol.41, issue.4, 2007.
DOI : 10.1051/ro:2007033
URL : https://hal.archives-ouvertes.fr/hal-00821340

R. 1. Babonneau and J. P. Vial, Proximal-accpm with a nonlinear constraint and active set strategy to solve nonlinear multicommodity flow problems, Mathematical Programming, forthcoming, 2006.

D. Bertsekas and E. M. Gafni, Two-metric projection methods for constrained optimization, SIAM J. Control and Optimization, vol.22, pp.936-964, 1983.

A. Frangioni, Generalized Bundle Methods, SIAM Journal on Optimization, vol.13, issue.1, pp.117-156, 2003.
DOI : 10.1137/S1052623498342186
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.267

M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.95-110, 1956.
DOI : 10.1002/nav.3800030109

M. Gerla, L. Fratta, and L. Kleinrock, The flow deviation method: an approach to storeand-forward communication network design, Networks, vol.3, pp.97-133, 1984.

J. Goffin, J. Gondzio, R. Sarkissian, and J. Vial, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Mathematical Programming, pp.131-154, 1996.
DOI : 10.1007/BF02614381

J. Hiriart-urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, 1993.
DOI : 10.1007/978-3-662-02796-7

J. E. Kelley, The cutting plane method for solving convex programs, J. of the SIAM, vol.8, pp.703-712, 1960.

C. Lemaréchal, A. S. Nemirovskii, and Y. E. Nesterov, New variants of bundle methods, Mathematical Programming, pp.111-148, 1995.
DOI : 10.1007/BF01585555

C. Lemaréchal and C. Sagastizábal, Variable metric bundle methods: From conceptual to implementable forms, Mathematical Programming, vol.2, issue.3, pp.393-410, 1997.
DOI : 10.1007/BF02614390

C. Lemaréchal, J. Strodiot, and A. Bihain, On a bundle method for nonsmooth optimization, Nonlinear Programming 4, pp.245-282, 1981.

P. Mahey, A. Ouorou, L. Leblanc, and J. Chifflet, A new proximal decomposition algorithm for routing in telecommunication networks, Networks, vol.31, issue.4, pp.227-238, 1998.
DOI : 10.1002/(SICI)1097-0037(199807)31:4<227::AID-NET3>3.0.CO;2-F

J. J. Moré, Recent developments in algorithms and software for trust region m ethods, Mathematical Programming, the State of the Art, pp.258-287, 1983.

A. Ouorou, . Ph, J. Mahey, and . 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

H. Schramm and J. Zowe, A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results, SIAM Journal on Optimization, vol.2, issue.1, pp.121-152, 1992.
DOI : 10.1137/0802008

. Ph and . Wolfe, Convergence theory in nonlinear programming, Integer and Nonlinear Programming, pp.1-36, 1970.