The minimum cost flow problem and the maximum flow problem on networks with time-dependent characteristics and nonlinear cost functions on arcs are considered. The algorithms for determining optimal solutions of the single-commodity and multicommodity network flow problems based on the timeexpanded network method are elaborated. Some applications of the optimal flow problems are provided.
CITATION STYLE
Fonoberova, M. (2012). Optimal flows in dynamic networks and algorithms for their finding. In Springer Optimization and Its Applications (Vol. 57, pp. 363–403). Springer International Publishing. https://doi.org/10.1007/978-1-4614-0754-6_13
Mendeley helps you to discover research relevant for your work.