A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Improved Algorithms for Bipartite Network Flow
SIAM Journal on Computing
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
Mathematics of Operations Research
Sequential and parallel algorithms for minimum flows
The Korean Journal of Computational & Applied Mathematics
A highest-label preflow algorithm for the minimum flow problem
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
About preflow algorithms for the minimum flow problem
WSEAS Transactions on Computer Research
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
The wave preflow algorithm for the minimum flow problem
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
About minimum cost flow problem in networks with node capacities
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Network information flow with correlated sources
IEEE Transactions on Information Theory
A maximum flow algorithm using MA ordering
Operations Research Letters
| Hi-index | 0.00 |
In this paper, we study different network flow problems in networks with node capacity. The literature on network flow problems is extensive, but these problems are described and studied in networks in which only arcs could have finite capacities. There are several applications that arise in practice and that can be reduced to a specific network flow problem in a network in which also nodes have limited capacity. This is the reason for focusing on maximum flow problem, minimum flow problem and minimum cost flow problem in a network with node capacities.