Parallel primal-dual methods for the minimum cost flow problem

In this paper we discuss the parallel asynchronous implementation of the classical primal-dual method for solving the linear minimum cost network flow problem. Multiple augmentations and price rises are simultaneously attempted starting from several nodes with possibly outdated price and flow inform...

Full description

Saved in:
Bibliographic Details
Published inComputational optimization and applications Vol. 2; no. 4; pp. 317 - 336
Main Authors Bertsekas, Dimitri P., Casta on, David A.
Format Journal Article
LanguageEnglish
Published 01.12.1993
Online AccessGet full text
ISSN0926-6003
1573-2894
1573-2894
DOI10.1007/BF01299544

Cover

More Information
Summary:In this paper we discuss the parallel asynchronous implementation of the classical primal-dual method for solving the linear minimum cost network flow problem. Multiple augmentations and price rises are simultaneously attempted starting from several nodes with possibly outdated price and flow information. The results are then merged asynchronously subject to rather weak compatibility conditions.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0926-6003
1573-2894
1573-2894
DOI:10.1007/BF01299544