In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n nodes and m arcs and runs in O(n log n (m + n log n)) time. Using a standard transformation, thjis ...

We consider the problem of finding the minimum capacity cut in a directed network G with n nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum cut separating a designated source node s from a designated sink node t, and by varying the sink node one...

one of the most important problems in schematization and watershed management is determining the watershed measures impacts on flow distribution. flow distribution algorithms grouped into two main types include single flow direction (sfd) algorithm and multiple flow direction (mfd) algorithms. in many package of gis use the single flow direction to runoff routing. in this research studied water...

This is a supplementary note on M. X. Goemans, S. Iwata, and R. Zenklusen’s paper that proposes a flow model based on polylinking systems. Their flow model is a series (or tandem) connection of polylinking systems. We can consider an apparently more general model of a polylinking flow network which consists of an ordinary arccapacitated network endowed with polylinking systems on the vertex set...

A numerical study of hemodynamic parameters of pulsatile blood flow is presented in a stenotic artery with A numerical study of hemodynamic parameters of pulsatile blood flow is presented in a stenotic artery with non-Newtonian models using ADINA. Blood flow was considered laminar, and the arterial wall was considered rigid. Studied stenosis severities were 30, 50, and 70% of the cross-section...

The article studies the generalisation of the maximum flow of minimum cost problem for the case of maximum discrete dynamic flow of minimum travelling cost and travelling time. The approach is based on iteratively generating efficient extreme points in the objective space by solving a series of single objective maximum flow problems with different objective functions. On each of the iterations,...

We consider the minimum cost network flow problem min(cx : Ax=b , x > 0) on a graph G = (V,E). First we give a minor modification of Edmonds-Karp scaling technique, and we show that it solves the minimum cost flow problem in 0((|V|'^ log 1v|)(|e| + |V| log |v|)) steps. We also provide two dual simplex algorithms that solve the minimum cost flow problem in 0(|v| log |v|) pivots and 0(|v| log |v|...

Flow characteristics and heat transfer performances of carboxymethyl cellulose (CMC) aqueous solutions in the microchannels with flow control structures were investigated in this study. The researches were carried out with various flow rates and concentrations of the CMC aqueous solutions. The results reveal that the pin-finned microchannel has the most uniform temperature distribution on the s...

Constructal theory is the view that (i) the generation of images of design (pattern, rhythm) in nature is a phenomenon of physics and (ii) this phenomenon is covered by a principle (the constructal law): 'for a finite-size flow system to persist in time (to live) it must evolve such that it provides greater and greater access to the currents that flow through it'. This law is about the necessit...