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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational optimization and applications Ročník 18; číslo 2; s. 175 - 190
Hlavní autoři: Beraldi, P., Guerriero, F., Musmanno, R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.02.2001
Témata:
Algorithms
Convergence
Costs
Mathematics
Methods
Parallel processing
ISSN:0926-6003, 1573-2894
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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]
Bibliografie: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