An improved linear approximation algorithm for the network equilibrium (packet switching) problem

We present a method for accelerating the convergence of the algorithm based on the Frank and Wolfe linear approximation method for the convex cost multicommodity flow problem known as the "equilibrium traffic assignment problem" in transportation networks and as the "optimal routing of packet switched messages" in communication networks. The acceleration of the convergence of this algorithm is achieved with a non trivial adaptation of Wolfe's suggestion of an "away" step in the linear approximation method and a variant of this adaptation based on restriction.