Parallel algorithms for solving the convex minimum cost flow problem
The separable convex cost network flow problem is considered. A parallel asynchronous version of the \(\varepsilon\)-relaxation method is proposed and its correctness is proved. Two implementations of the parallel method are presented and their numerical performance on several standard test problems is empirically analyzed. Significant speed up values with respect to the sequential counterpart are obtained especially for large scale problems.
scientific article; zbMATH DE number 1592720