Date Added: Jan 2010
The authors present a number of significant engineering insights on what makes a good configuration for medium-to large-size WMNs when the objective function is to maximize the minimum throughput among all flows. For this, they first develop efficient and exact computational tools using column generation with greedy pricing that allow one to compute exact solutions for networks significantly larger than what has been possible so far. They also develop very fast approximations that compute nearly optimal solutions for even larger cases. Finally, they adapt their tools to the case of proportional fairness and show that the engineering insights are very similar.