Internet Routing and Related Topology Issues, SIAM Journal on Discrete Mathematics, vol.17, issue.1, pp.18-49, 2004. ,
DOI : 10.1137/S0895480100377428
Integer Programming Approaches to Access and Backbone IP Network Planning, 2002. ,
DOI : 10.1007/978-3-540-79409-7_7
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
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
Valid inequalities for a shortest-path routing optimization problem, International Network Optimization Conference, 2007. ,
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
On the Hardness of Equal Shortest Path Routing, Electronic Notes in Discrete Mathematics, vol.41, 2012. ,
DOI : 10.1016/j.endm.2013.05.123
URL : https://hal.archives-ouvertes.fr/hal-00926348
On the Hardness of Equal Shortest Path Routing, Proceedings of the International Network Optimization Conference (INOC'13), 2013. ,
DOI : 10.1016/j.endm.2013.05.123
URL : https://hal.archives-ouvertes.fr/hal-00926348
Optimization of Internet Protocol network design and routing, Networks, vol.396, issue.47, pp.39-53, 2004. ,
DOI : 10.1002/net.10102
Administrative weight allocation for PNNI routing algorithms, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552), pp.347-352, 1998. ,
DOI : 10.1109/HPSR.2001.923659
On open shortest path first related network optimisation problems, Performance Evaluation, vol.48, issue.1-4, pp.1-4201, 2002. ,
DOI : 10.1016/S0166-5316(02)00036-6