On methods for the convex multi-commodity flow problem
2009 (English)In: International journal of pure and applied mathematics, ISSN 1311-8080, Vol. 50, no 2, 157-164 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2009. Vol. 50, no 2, 157-164 p.
Math, Optimization, Programming, Routing, Telecom, Traffic
Transport Systems and Logistics
IdentifiersURN: urn:nbn:se:kth:diva-71401ScopusID: 2-s2.0-78649765220OAI: oai:DiVA.org:kth-71401DiVA: diva2:486732
QC 201202152012-01-312012-01-312012-02-15Bibliographically approved