A bundle-type algorithm for routing in telecommunication data networks - BIPOP Accéder directement au contenu
Article Dans Une Revue Computational Optimization and Applications Année : 2009

A bundle-type algorithm for routing in telecommunication data networks

Résumé

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).

Dates et versions

hal-00821390 , version 1 (09-05-2013)

Identifiants

Citer

Claude Lemaréchal, Adam Ouorou, Giorgios Petrou. A bundle-type algorithm for routing in telecommunication data networks. Computational Optimization and Applications, 2009, 44 (3), pp.385-409. ⟨10.1007/s10589-007-9160-7⟩. ⟨hal-00821390⟩
146 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More