A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
In many real-world situations, there are numerous network optimization problems where the network attributes depend on time. In this paper, we consider single-source single-sink discrete-time dynamic network flow problems. We review some algorithms for the quickest flow problems in two environments (to the network attributes): time-invariant and time-variant. This paper mainly focuses on the existing algorithms for a later one. In literature, most of the authors have made their objectives todoi:10.3126/jist.v26i1.37826 fatcat:vkzkwkgfcjbpvmyhiabit4xa6m