D. Papadimitriou and B. Fortz, Time-dependent combined network design and routing optimization, 2014 IEEE International Conference on Communications (ICC), 2014.
DOI : 10.1109/ICC.2014.6883472
URL : https://hal.archives-ouvertes.fr/hal-01255249

D. Papadimitriou and B. Fortz, Methods for time-dependent combined network design and routing optimization, 2014 IEEE Global Communications Conference, pp.1303-1309, 2014.
DOI : 10.1109/GLOCOM.2014.7036988
URL : https://hal.archives-ouvertes.fr/hal-01255248

B. Fortz and M. Thorup, Internet traffic engineering by optimizing ospf weights Nineteenth annual joint conference of the IEEE computer and communications societies, Proceedings. IEEE, vol.2, pp.519-528, 2000.

B. Fortz and M. Thorup, Increasing Internet Capacity Using Local Search, Computational Optimization and Applications, vol.29, issue.1, pp.13-48, 2004.
DOI : 10.1023/B:COAP.0000039487.35027.02
URL : https://hal.archives-ouvertes.fr/hal-01255580

M. Gerla and L. Kleinrock, Communication nets: stochastic message flow and delay, pp.48-60, 1977.

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, pp.385-409, 2007.
DOI : 10.1287/ijoc.4.3.235

M. Pióro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks, 2004.

S. Balon, F. Skivée, and G. Leduc, How Well Do Traffic Engineering Objective Functions Meet TE Requirements?, Proceedings of IFIP Networking, 2006.
DOI : 10.1145/1111322.1111341

E. Gourdin and O. Klopfenstein, Comparison of different qos-oriented objectives for multicommodity flow routing optimization, Proceedings of the International Conference on Telecommunications, 2006.

L. A. Cox, L. Davis, and Y. Qiu, Dynamic anticipatory routing in circuitswitched telecommunications networks, Handbook of Genetic Algorithms, vol.11, pp.229-340, 1991.

C. Barnhart, C. A. Hane, and P. H. Vance, Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems, Operations Research, vol.48, issue.2, pp.318-326, 2000.
DOI : 10.1287/opre.48.2.318.12378

F. Alvelos and J. V. De-carvalho, Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem, in: International Network Optimization Conference, pp.7-12, 2003.

M. Belaidouni and W. Ben-ameur, On the minimum cost multiple-source unsplittable flow problem, RAIRO - Operations Research, vol.2, issue.3, pp.253-273, 2007.
DOI : 10.1287/moor.2.1.66

M. Parker and J. Ryan, A column generation algorithm for bandwidth packing, Telecommunication Systems, vol.33, issue.1, pp.185-195, 1993.
DOI : 10.1007/BF02109857

K. Park, S. Kang, and S. Park, An Integer Programming Approach to the Bandwidth Packing Problem, Management Science, vol.42, issue.9, pp.1277-1291, 1996.
DOI : 10.1287/mnsc.42.9.1277

J. Geffard, A solving method for singly routing traffic demand in telecommunication networks, Annales des télécommunications, vol.56, pp.140-149, 2001.

A. Atamtürk and D. Rajan, On splittable and unsplittable flow capacitated network design arc-set polyhedra, Mathematical Programming, vol.92, issue.2, pp.315-333, 2002.
DOI : 10.1007/s101070100269

A. Benhamiche, A. R. Mahjoub, N. Perrot, and E. Uchoa, Unsplittable non-additive capacitated network design using set functions polyhedra, Computers & Operations Research, vol.66, pp.105-115, 2016.
DOI : 10.1016/j.cor.2015.08.009

F. S. Salman, R. Ravi, and J. N. Hooker, Solving the Capacitated Local Access Network Design Problem, INFORMS Journal on Computing, vol.20, issue.2, pp.243-254, 2008.
DOI : 10.1287/ijoc.1070.0237
URL : http://www.gsia.cmu.edu/andrew/ravi/public/ijoc08.pdf

K. L. Croxton, B. Gendron, and T. L. Magnanti, A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems, Management Science, vol.49, issue.9, pp.1268-1273, 2003.
DOI : 10.1287/mnsc.49.9.1268.16570

K. L. Croxton, B. Gendron, and T. L. Magnanti, Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs, Operations Research, vol.55, issue.1, pp.146-157, 2007.
DOI : 10.1287/opre.1060.0314
URL : http://www.unipa.it/Odysseus/Odysseus2003_file/odysseus-main_file/pdf/CroxtonGendronMagnanti.pdf

A. Balakrishnan and S. C. Graves, A composite algorithm for a concave-cost network flow problem, Networks, vol.14, issue.2, pp.175-202, 1989.
DOI : 10.1007/BFb0120690

B. Gendron and L. Gouveia, Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems, Transportation Science, vol.51, issue.2, 2014.
DOI : 10.1287/trsc.2015.0634

J. M. Kleinberg, Single-source unsplittable flow, Proceedings of 37th Conference on Foundations of Computer Science, pp.68-77, 1996.
DOI : 10.1109/SFCS.1996.548465
URL : http://www.cs.cornell.edu/home/kleinber/focs96-uf.ps

R. M. Karp, Reducibility among combinatorial problems, 1972.
DOI : 10.1007/978-3-540-68279-0_8

B. Fortz and M. Joyce-moniz, On the convex piecewise linear unsplittable multicommodity flow problem, 2016 12th International Conference on the Design of Reliable Communication Networks (DRCN), pp.9-13, 2016.
DOI : 10.1109/DRCN.2016.7470829
URL : https://hal.archives-ouvertes.fr/hal-01410555

L. A. Wolsey, Integer programming, 1998.

S. Orlowski, M. Pióro, A. Tomaszewski, and R. Wessäly, SNDlib 1.0? Survivable Network Design Library, extended version accepted in Networks, Proceedings of the 3rd International Network Optimization Conference Spa, Belgium, 2007.

X. Liu, S. Mohanraj, M. Pióro, and D. Medhi, Multipath Routing from a Traffic Engineering Perspective: How Beneficial Is It?, 2014 IEEE 22nd International Conference on Network Protocols, pp.143-154, 2014.
DOI : 10.1109/ICNP.2014.34
URL : http://sce.umkc.edu/~dmedhi/papers/lmpm-icnp-2014.pdf