On methods for the convex multi-commodity flow problem
Per Lindberg · International Journal of Pure and Apllied Mathematics · 2009
The Convex Multi-Commodity Flow Problem is a central routing problem in road and telecom traffic. We show that the traditional method for these problems, the Frank-Wolfemethod, still has a lot to give, through better search directions, and other amendments. In the end it can beat recent competitors, for accuracies of practical interest.