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

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.

Domaines: Réseaux et télécommunications [cs.NI]

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. ⟨hal-00371121⟩