Time-varying universal maximum flow problems

Citations of this article
Mendeley users who have this article in their library.
Get full text


We consider a time-varying network without parallel arcs and loops, where a flow must take a certain time to traverse an arc. The transit time on an arc and the capacity of an arc are all time-varying parameters, which depend on the departure time to traverse the arc. To depart at the best time, a flow can wait at the beginning vertex of an arc, which is however limited by a time-varying vertex capacity. All those parameters, namely, the transit time, the arc capacity, and the vertex capacity, are discrete functions of time t. The problem is to find an optimal solution to send the maximum flow from the source vertex to the sink vertex, within a given time T. Moreover, we address the so-called universal maximum flow problem, which is to find a solution that remains optimal when the time limit T is truncated to any t ≤ T. We consider three variants of the problem, with waiting at a vertex being arbitrarily allowed, strictly prohibited, and bounded, respectively. Relevant algorithms are proposed, which can find optimal solutions in pseudopolynomial time. © 2001 Elsevier Science Ltd.




Cai, X., Sha, D., & Wong, C. K. (2001). Time-varying universal maximum flow problems. Mathematical and Computer Modelling, 33(4–5), 407–430. https://doi.org/10.1016/S0895-7177(00)00252-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free