A parallel asynchronous implementation of the \(\epsilon\)-relaxation method for the linear minimum cost flow problem

DOI10.1016/S0167-8191(97)00003-3zbMath0904.68003OpenAlexW1990466231MaRDI QIDQ1391202

Patrizia Beraldi, Francesca Guerriero

Publication date: 22 July 1998

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(97)00003-3

zbMATH Keywords

\(\epsilon\)-relaxation methodnetwork optimizationspeedupasynchronous parallel algorithmsdistributed memory systemslinear minimum cost flow problem

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

This page was built for publication: A parallel asynchronous implementation of the \(\epsilon\)-relaxation method for the linear minimum cost flow problem