On solving the maximum flow over time problem with interval data

Flows over time is a generalization of standard network flows in which every arc has an element named transit time which specifies the amount of time needed for flow to travel through the arc. Although in most of network flow problems, transit times and capacities are given constant, stochastic or fuzzy numbers, but in some of real-world applications, the use of interval coefficients may serve the purpose better. So in this paper we suppose that transit times, capacities and consequently flows on arcs fall within specific ranges expressed as compact intervals and produce a maximum flow algorithm for this kind of flows.

Maximum flow over time, Interval-valued transit times, Interval-valued capacities, Temporally repeated flows