The flows in nets with generalized conservation principle
Let us consider the finite connected graph \(G=(V,E)\), where \(V\) and \(E\) are the sets of the nodes and the edges of the graph, respectively. The graph is supposed to be non-oriented. Let \(N(j)=\{i\in V:(i,j)\in E\}\). The authors study the following system of inequalities with respect to the unknown \(x_{ij}\): NEWLINE\[NEWLINE\sum_{j\in N(i)}\alpha_{ij}x_{ij}\in A_{i} \quad \text{for} i\in V, \;x_{ij}\in B_{ij},(i,j)\in E,NEWLINE\]NEWLINE where \(A_{i}, B_{ij}\) are some intervals and \(\alpha_{ij}\neq 0\). The elimination method for groups of unknowns is presented.
- Elimination of unknown flows running along intermediate and terminal subgraphs
- Solving the systems of linear inequalities on a graph by correcting its structure
- Method of elimination of a group of unknown flows in networks with the generalized Kirchhoff law
- On the solution of a locally finite system of linear inequalities with graph structure
- Solution of a locally finite system of linear inequalities with directed multigraph structure
- Method of elimination of a group of unknown flows in networks with the generalized Kirchhoff law
- Elimination of unknown flows running along intermediate and terminal subgraphs
- On the solution of a locally finite system of linear inequalities with graph structure
- Methods of finding dynamic flows in networks obeyed generalized Kirchhoff's law
- Solving the systems of linear inequalities on a graph by correcting its structure
- Solution of a locally finite system of linear inequalities with directed multigraph structure
This page was built for publication: The flows in nets with generalized conservation principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2739971)
