Parallel algorithms for solving the convex minimum cost flow problem
type: Item
instance of: scholarly article
title: Parallel algorithms for solving the convex minimum cost flow problem
zbMATH Open document ID: 0974.90026
DOI: 10.1023/A:1008778622003
author: Patrizia Beraldi
author: Francesca Guerriero
author: Roberto Musmanno
published in: Computational Optimization and Applications
publication date: 2001-09-07T00:00:00Z
review text: 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.
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1592720
zbMATH Keywords: convex minimum cost flow problem
zbMATH Keywords: \(\epsilon\)-relaxation method
zbMATH Keywords: asynchronous parallel algorithm
MaRDI profile type: Publication
Wikidata QID: Q58921798
description: scientific article; zbMATH DE number 1592720