Parallelization strategies of a row-action method for multicommodity network flow problems

Yair Censor, Emmanuel D. Chajakis, Stavros A. Zenios

Research output: Contribution to journalArticlepeer-review


We develop a decomposition algorithm for the quadratic multicommodity network flow problem, using a row-action primal-dual algorithm. The algorithm decomposes the problem first by commodity and then by arc. Hence, it is suitable for parallel implementations. We study two parallelization strategies of this algorithm. These are the “parallelization within a commodity” (PWC) and the “parallelization across commodities” (PAC). Both strategies are evaluated empirically. Extensive computational results indicate that (1) the row-action algorithm is efficient for a wide range of problem characteristics, (2) the algorithm achieves almost linear speedup on a small scale parallel architecture, and (3) the algorithm can solve efficiently very large problems, with up to 4000 nodes, 80000 arcs and 80 commodities.

Original languageEnglish
Pages (from-to)179-205
Number of pages27
JournalParallel Algorithms and Applications
Issue number2-3
StatePublished - 1 Jan 1995


  • Multicommodity
  • Network flows
  • Parallel optimization
  • Row-action algorithm

ASJC Scopus subject areas

  • Computer Science (all)


Dive into the research topics of 'Parallelization strategies of a row-action method for multicommodity network flow problems'. Together they form a unique fingerprint.

Cite this