Some aspects related to the structure of anon-linear network transport
ation problem are investigated. An improve ment of an algorithm proposed earlier is provided by the means of sequential and parallel programming and by using
several initial admissible solutions.An analysis of different ways of the
algorithm implementation in the Wolfram Language is done. O btained
testing results on problems with different dimensions and complexities
are presented.
