A Branch-and-Price Approach to the Bandwidth Allocation Problem in Wireless Networks
Résumé
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.