Optimal MaxWeight scheduling in a multihop wireless network via branch and bound

We consider the problem of MaxWeight scheduling in wireless multihop networks. This problem is known to be NP-hard. We propose a solution method, based on the branch and bound technique, which solves globally the MaxWeight scheduling problem with an optimality certificate. Efficient analytic bounding techniques are introduced as well.