G. Baier, E. Khler, and M. Skutella, The k-Splittable Flow Problem, Algorithmica, vol.42, issue.3-4, pp.231-248, 2005.
DOI : 10.1007/s00453-005-1167-9

W. Ben-ameur and E. Gourdin, Internet Routing and Related Topology Issues, SIAM Journal on Discrete Mathematics, vol.17, issue.1
DOI : 10.1137/S0895480100377428

A. Bley, Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths, Networks, vol.72, issue.1, pp.29-36, 2007.
DOI : 10.1002/net.20163

A. Bley, Approximability of unsplittable shortest path routing problems, Networks, vol.91, issue.1, pp.23-46, 2009.
DOI : 10.1002/net.20303

A. Bley, B. Fortz, E. Gourdin, K. Holmberg, O. Klopfenstein et al., Optimization of OSPF Routing in IP Networks, Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks, pp.199-240, 2009.
DOI : 10.1007/978-3-642-02250-0_8
URL : https://hal.archives-ouvertes.fr/hal-01255267

A. Bley and T. Koch, Integer Programming Approaches to Access and Backbone IP Network Planning, Modeling, Simulation and Optimization of Complex Processes, pp.87-110, 2008.
DOI : 10.1007/978-3-540-79409-7_7

C. Chekuri and N. Korula, Single-sink network design with vertex connectivity requirements, FSTTCS, volume 2 of LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.131-142, 2008.

W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver, Combinatorial optimization, 1998.

M. Dzida, M. Mycek, M. Pióro, A. Tomaszewski, and M. Zagozdzon, Valid inequalities for a shortest-path routing optimization problem, International Network Optimization Conference, 2007.

B. Fortz and M. Thorup, Optimizing OSPF/IS-IS weights in a changing world, IEEE Journal on Selected Areas in Communications, vol.20, issue.4, pp.756-767, 2002.
DOI : 10.1109/JSAC.2002.1003042
URL : https://hal.archives-ouvertes.fr/hal-01255600

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

J. Håstad, Some optimal inapproximability results, Journal of the ACM, vol.48, issue.4, pp.798-859, 2001.
DOI : 10.1145/502090.502098

K. Holmberg and Y. Carbonneaux, Optimization of Internet Protocol network design and routing, Networks, vol.396, issue.47, pp.39-53, 2004.
DOI : 10.1002/net.10102

R. Izmailov, B. Sengupta, and A. Iwata, Administrative weight allocation for 25
DOI : 10.1109/hpsr.2001.923659

M. Pióro, ´. A. Szentesi, J. Harmatos, A. Jüttner, P. Gajowniczek et al., On open shortest path first related network optimisation problems, PNNI routing algorithms Performance Switching and Routing, pp.347-352, 2001.
DOI : 10.1016/S0166-5316(02)00036-6