A bundle-type algorithm for routing in telecommunication data networks

Abstract : To optimize the quality of service through a telecommunication network, we propose an algorithm based on Lagrangian relaxation. The bundle-type dual algorithm is adapted to the present situation, where the dual function is the sum of a polyhedral function (coming from shortest path problems) and of a smooth function (coming from the congestion function).
Type de document :
Article dans une revue
Computational Optimization and Applications, Springer Verlag, 2009, 44 (3), pp.385-409. 〈10.1007/s10589-007-9160-7〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00821390
Contributeur : Brigitte Bidégaray-Fesquet <>
Soumis le : jeudi 9 mai 2013 - 15:44:10
Dernière modification le : jeudi 11 janvier 2018 - 06:21:52

Identifiants

Collections

Citation

Claude Lemaréchal, Adam Ouorou, Giorgios Petrou. A bundle-type algorithm for routing in telecommunication data networks. Computational Optimization and Applications, Springer Verlag, 2009, 44 (3), pp.385-409. 〈10.1007/s10589-007-9160-7〉. 〈hal-00821390〉

Partager

Métriques

Consultations de la notice

281