R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows: theory, algorithms, and applications, 1993.
DOI : 10.21236/ADA594171

W. Ben-ameur and A. Ouorou, Mathematical models of the delay constrained routing problem, Algorithmic Operations Research, vol.1, issue.2, 2006.

D. Bertsekas and R. Gallager, Data networks, 1992.

T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms, 2001.

J. R. Correa, A. S. Schulz, and N. E. Moses, Fast, Fair, and Efficient Flows in Networks, Operations Research, vol.55, issue.2, pp.215-225, 2007.
DOI : 10.1287/opre.1070.0383
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.8944

S. Even, A. Itai, and A. Shamir, On the Complexity of Timetable and Multicommodity Flow Problems, SIAM Journal on Computing, vol.5, issue.4, pp.691-703, 1976.
DOI : 10.1137/0205048

H. Hijazi, P. Bonami, G. Cornuéjols, and A. Ouorou, Mixed-integer nonlinear programs featuring ???on/off??? constraints, Computational Optimization and Applications, vol.19, issue.1, pp.537-558, 2012.
DOI : 10.1016/0098-1354(95)00164-W
URL : https://hal.archives-ouvertes.fr/hal-00428716

M. Minoux, Networks synthesis and optimum network design problems: Models, solution methods and applications, Networks, vol.14, issue.3, pp.313-360, 1989.
DOI : 10.1287/mnsc.14.7.429

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

N. Robertson and P. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1984.
DOI : 10.1016/0095-8956(84)90013-3
URL : http://doi.org/10.1006/jctb.1996.0059

A. Schrijver, Combinatorial optimization. Polyhedra and efficiency, Algorithms and Combinatorics, vol.24, 2003.

C. Touati, E. Altman, and J. Galtier, Semi-definite programming approach for bandwidth allocation and routing in networks, Game Theory and Applications, vol.9, pp.169-179, 2003.
DOI : 10.1016/s1388-3437(03)80258-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2698