A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Minimize Traffic Congestion: An Application of Maximum Flow in Dynamic Networks An important characteristic of a network is its capacity to carry flow. What, given capacities on the arcs, is the maximum flow that can be sent between any two nodes? The dynamic version of the maximum flow problem on networks that generalizes the well-known static one. This basic combinatorial optimization problem has a large implementation for many practical problems. Traffic congestion is a consequence of thedoi:10.2478/v10294-012-0007-1 fatcat:otdcx34arff73cxbr3b4timisu