K. Ravindra, T. L. Ahuja, J. B. Magnanti, and . Orlin, Network flows : theory, algorithms, and applications, 1993.

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

P. Bonami, D. Mazauric, and Y. Vaxès, Maximum flow under proportional delay constraint, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00947049

R. José, A. S. Correa, N. E. Schulz, and . Moses, Fast, fair, and efficient flows in networks On the complexity of timetable and multicommodity flow problems, EIS76] Shimon Even, Alon Itai, and Adi Shamir, pp.215-225691, 1976.

N. Garg, V. V. Vazirani, and M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica, vol.11, issue.5, pp.3-20, 1997.
DOI : 10.1007/BF02523685

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.1007/s10589-011-9424-0
URL : https://hal.archives-ouvertes.fr/hal-00428716

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

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.