Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
Mathematics of Operations Research
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Network information flow with correlated sources
IEEE Transactions on Information Theory
About flow problems in networks with node capacities
WSEAS Transactions on Computers
Incremental algorithms for the minimum cost flow problem
Proceedings of the 15th WSEAS international conference on Computers
| Hi-index | 0.00 |
In this paper, we describe and solve the problem of establishing a minimum cost flow in networks with node capacities. We show that this problem, which has several applications, can be reduced to a standard minimum cost flow problem in a transformed network.