A Branch-and-Price Approach to the Bandwidth Allocation Problem in Wireless Networks

Cristiana Gomes 1 Gurvan Huiban 1 Hervé Rivano 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We deal with a bandwidth allocation problem called Round Weighting Problem (RWP) [1], that jointly considers the multi-commodity ow prob- lem and the weighted fractional coloring problem. We have to nd sets of compatible communication links in a network, called rounds, such that the routers bandwidth requirements are achieved.
Type de document :
Communication dans un congrès
International Symposium on Combinatorial Optimization (CO), Mar 2008, Coventry, United Kingdom. pp.44, 2008
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00371121
Contributeur : Hervé Rivano <>
Soumis le : jeudi 26 mars 2009 - 15:13:05
Dernière modification le : mercredi 8 juillet 2009 - 15:41:50

Identifiants

  • HAL Id : hal-00371121, version 1

Collections

Citation

Cristiana Gomes, Gurvan Huiban, Hervé Rivano. A Branch-and-Price Approach to the Bandwidth Allocation Problem in Wireless Networks. International Symposium on Combinatorial Optimization (CO), Mar 2008, Coventry, United Kingdom. pp.44, 2008. 〈hal-00371121〉

Partager

Métriques

Consultations de la notice

131