A Mass Balancing Theorem for the Economical Network Flow Maximisation
نویسندگان
چکیده
منابع مشابه
Introducing Simplex Mass Balancing Method for Multi-commodity Flow Network with a Separator
Maximization of flow through the network has remained core issue in the field of optimization. In this paper a new advanced network problem is introduced, i.e., a multi-commodity network with a separator. This network consists of several sub-networks linked through a commodity separator. The objective is to maximize the flow of the commodity of interest from the commodity mixture at the output ...
متن کاملA Mass Conservative Method for Numerical Modeling of Axisymmetric flow
In this paper, the cell-centered finite volume method (CC-FVM) has been presented to simulate the axisymmetric radial flow toward a pumping well. The model is applied to the unstructured triangular grids which allows to simulate inhomogeneous and complex-shaped domains. Due to the non-orthogonality of the irregular grids, the multipoint flux approximation (MPFA) methods are used to discretize t...
متن کاملEconomical extremal hypergraphs for the Erdős-Selfridge theorem
A positional game can be thought of as a generalization of Tic-Tac-Toe played on a hypergraph (V,H). We study the Maker-Breaker game in which Maker wins if she occupies all of the vertices in an edge of H; otherwise Breaker wins. The Erdős–Selfridge Theorem, a significant result in positional game theory, gives criteria for the existence of an explicit winning strategy for Breaker for the game ...
متن کاملBalancing Applied to Maximum Network Flow
We explore balancing as a definitional and algorithmic tool for finding minimum cuts and maximum flows in ordinary and parametric networks. We show that a standard monotonic parametric maximum flow problem can be formulated as a problem of computing a particular maximum flow that is balanced in an appropriate sense. We present a divide-and-conquer algorithm to compute such a balanced flow in a ...
متن کاملOn Search for all d-MCs in a Network Flow
A number of problems in several areas such as power transmission and distribution, communication and transportation can be formulated as a stochastic-flow network (SFN). The system reliability of an SFN can be computed in terms of all the upper boundary points, called d-MinCuts (d-MCs). Several algorithms have been proposed to find all the d-MCs in an SFN. Here, some recent studies in the liter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Computer Networks & Communications
سال: 2015
ISSN: 0975-2293,0974-9322
DOI: 10.5121/ijcnc.2015.7602