Two massively parallel algorithms for large scale linear and convex quadratic network flow problems are proposed and studied. The methods are based on the alternating step method for monotropic programming. The original network flow problem is decomposed in simple subproblems involving only few variables for which solution in closed form exists. Computational results obtained on the CRAY T3D show that the methods hold the promise of solving extremely large size problems.
Massively parallel solution of large scale network flow problems
DE LEONE, Renato;MERELLI, Emanuela;BUTI, Sara
1995-01-01
Abstract
Two massively parallel algorithms for large scale linear and convex quadratic network flow problems are proposed and studied. The methods are based on the alternating step method for monotropic programming. The original network flow problem is decomposed in simple subproblems involving only few variables for which solution in closed form exists. Computational results obtained on the CRAY T3D show that the methods hold the promise of solving extremely large size problems.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
