نتایج جستجو برای: minimum flow
تعداد نتایج: 638710 فیلتر نتایج به سال:
This article considers the problems of maximum flow and minimum cost flow determining in fuzzy network. Parameters of fuzzy networks are fuzzy arc capacities in the case of maximum flow finding and transmission costs of one flow unit in the case of minimum cost flow finding. These parameters are represented as fuzzy triangular numbers. Conventional rules of operating with fuzzy triangular numbe...
Directed hypergraphs have been introduced quite recently in connection with different application areas, such as propositional satisfiability, deductive data bases and Leontief substitution systems. In [Jeroslow, Martin, Rardin&Wang, 1989], the uncapacitated min-cost flow problem on hypergraphs is considered, and its properties are studied. Here we address the capacitated case, and show how the...
In the present paper, we apply the network simplex algorithm for solving the minimum cost flow problem, to the maximum flow problem. Then we prove that the cycling phenomenon which causes the infinite loop in the algorithm, does not occur in the network simplex algorithm associated with the maximum flow problem.
Flow pattern around the bridge piers includes water surface profile, velocity profile, shear velocity, shear stress distribution, etc. In this research, the effects of the base shape along with scale effects on the flow pattern around the rectangular bridge piers were numerically calculated through "Fluent Software", using Horizontal Velocity Distribution (Vx) and Vertical Velocity Distribution...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید