Weighted sum-rate maximization in singlecast and multicast wireless networks - Global optimum via branch and bound

We consider the problem of weighted sum-rate maximization (WSRMax) in wireless networks. This problem is known to be NP-hard and it plays a central role in resource allocation, link scheduling or in finding achievable rate regions for both singlecast and multicast networks. We propose a solution method, based on the branch and bound technique, which solves globally the WSRMax problem with an optimality certificate. Efficient bounding techniques are introduced as well.