Sciweavers

Share
NETWORKS
2008

A simple method for improving the primal simplex method for the multicommodity flow problem

8 years 4 months ago
A simple method for improving the primal simplex method for the multicommodity flow problem
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subproblem can be contracted to a problem on a much smaller graph. We then solve these problems using the simplex method. We test the algorithm on benchmark instances, and show its improvement over the usual simplex algorithm.
Agustín Bompadre, James B. Orlin
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where NETWORKS
Authors Agustín Bompadre, James B. Orlin
Comments (0)
books