Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem

In this paper we deal with the solution of the separable convex cost network flow problem. In particular, we propose a parallel asynchronous version of the [epsilon]-relaxation method and we prove theoretically its correctness. We present two implementations of the parallel method for a shared memor...

Full description

Saved in:
Bibliographic Details
Published in:Computational optimization and applications Vol. 18; no. 2; pp. 175 - 190
Main Authors: Beraldi, P., Guerriero, F., Musmanno, R.
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 01.02.2001
Subjects:
Algorithms
Convergence
Costs
Mathematics
Methods
Parallel processing
ISSN:0926-6003, 1573-2894
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we deal with the solution of the separable convex cost network flow problem. In particular, we propose a parallel asynchronous version of the [epsilon]-relaxation method and we prove theoretically its correctness. We present two implementations of the parallel method for a shared memory multiprocessor system, and we empirically analyze their numerical performance on different test problems. The preliminary numerical results show a good reduction of the execution time of the parallel algorithm with the respect to the sequential counterpart. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0926-6003
1573-2894
DOI:10.1023/A:1008778622003