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

P. Bonami, A. Waechter, L. Biegler, A. Conn, G. Cornuejols et al., An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs, Discrete Optimization, pp.186-204, 2008.

G. M. Guisewite and P. M. Pardalos, Algorithms for the single-source uncapacitated minimum concavecost network flow problem, Journal of Global Optimization, vol.19, issue.2, pp.121-139, 1991.

F. S. Hillier, Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables, Management Science, vol.14, issue.1, pp.14-15, 1967.
DOI : 10.1287/mnsc.14.1.34

J. Kilpi and I. Norros, Testing the Gaussian approximation of aggregate traffic, Proceedings of the second ACM SIGCOMM Workshop on Internet measurment , IMW '02, pp.49-61, 2002.
DOI : 10.1145/637201.637207

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

E. A. Medova, Chance-Constrained Stochastic Programming for Integrated Services Network Management, Annals of Operations Research, vol.81, pp.213-229, 1998.
DOI : 10.1023/A:1018901022726

K. Meesublak, Network design under demand uncertainty, Proc. of the Asia-Pacific Advanced Network Meeting, 2008.

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

A. Weintraub and J. Vera, A Cutting Plane Approach for Chance Constrained Linear Programs, Operations Research, vol.39, issue.5, pp.39-44, 1991.
DOI : 10.1287/opre.39.5.776