IJPAM: Volume 50, No. 2 (2009)

ON METHODS FOR THE CONVEX
MULTI-COMMODITY FLOW PROBLEM

P.O. LindbergDepartment of Mathematics, Linköping University, Linköping, 58330, SWEDEN
Department of Mathematics
Linköping University
Linköping, 58330, SWEDEN
e-mail: [email protected]
and
Department of Transport and Economics
KTH - Royal Institute of Technology
Stockholm, SWEDEN


Abstract.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.

Received: August 14, 2008

AMS Subject Classification: 90-02

Key Words and Phrases: routing, telecom, traffic, optimization, math. programming

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2009
Volume: 50
Issue: 2