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

A. Bley, Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths, Proceedings of the Second International Network Optimization Conference, 2005.
DOI : 10.1002/net.20163

A. Bley, On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem, Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization, pp.97-110, 2005.
DOI : 10.1007/11496915_8

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

W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver, Combinatorial optimization, 1998.
DOI : 10.1002/9781118033142
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.8315

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

R. Izmailov, B. Sengupta, and A. Iwata, Administrative weight allocation for PNNI routing algorithms, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552), pp.347-352, 2001.
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, Performance Evaluation, vol.48, issue.1-4, pp.201-223, 2002.
DOI : 10.1016/S0166-5316(02)00036-6