Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem

Authors:
P. Beraldi;F. Guerriero;R. Musmanno
Affiliations:
Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, 87036 Rende (CS), Italy;Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, 87036 Rende (CS), Italy;Facoltà di Ingegneria, Università degli Studi di Lecce, 73100 Lecce, Italy
Venue:
Computational Optimization and Applications
Year:
2001

Citing 7
Cited 1

Relaxation methods for network flow problems with convex arc costs

SIAM Journal on Control and Optimization
Relaxation methods for minimum cost ordinary and generalized network flow problems

Operations Research
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Finding minimum-cost circulations by successive approximation

Mathematics of Operations Research
An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems

SIAM Journal on Optimization
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS

EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
Epsilon-relaxation and auction algorithms for the convex cost network flow problem

Epsilon-relaxation and auction algorithms for the convex cost network flow problem

On optimization of expertise matching with various constraints

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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