About Flow Problems in Networks with Node Capacities
Laura Ciupală · WSEAS Transactions on Computers archive · 2009
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.