Abstract
The classical maximum flow problem is to send flow from the source to the sink as much as possible. The problem is static, in that arc capacity is a constant. Max-flow min-cut theorem of Fold and Fulkerson [1] is a fundamental result which reveals the relationship between the maximum flow and the minimum cut in a static network. It has played an important role not only in investigating the classical maximum flow problem, but also in developing graph theory, since many results could be regarded as its corollaries.
In practical situations, there are, however, numerous problems where the attributes of the network under consideration are time-varying. In such a network, 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. To depart at the best time, a flow can wait at the beginning vertex of an arc, which is however constrained by a time-varying vertex capacity. For instance, consider a network in which several cargo-transportation services are available between a number of cities. These may include air transportation, sea transportation, and road transportation, which are available at different times and have different capacities. Waiting at a city is permitted, but it is limited by the space of the warehouse, and dependent upon the time. A question often asked is: what is the maximum flow that can be sent between two particular cities within a certain duration T?
We show that this time-varying maximum flow problem is NP-complete. We then establish the max-flow min-cut theorem in the time-varying version. With this result, we develop an approach, which can solve the time-varying maximum flow problem with arbitrary waiting time at vertices in a pseudopolynomial time.
This research was partially supported by the Research Grants Council of Hong Kong under Earmarked Grant No. CUHK 278/94E and Earmarked Grant No. CUHK 4135/97E.
On leave from IBM T.J. Watson Research Center, Yorktown Heights NY 10598, U.S.A.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ford, L.R. and Fulkereon, D.R. (1962) Flows in networks. Princeton University Press, Princeton, New Jersey
Halpern, J. (1979) Generalized dynamic flows. Networks 9, 133–167
Anderson, E.J., Nash, P., Philpott, A.B. (1982) A class of continuous network flow problems. Mathematics of Operations Research. 7, 4, 501–514
Minieka, E. (1978) Optimization algorithms for networks and graphs. Marcel Dekker. INC., New York
Cai, X., Kloks, T., Wong, C.K. (1997) Time-varying shortest path problems with constraints. Networks. 29, 3, 141–149
Gale, D. (1959) Transient flows in networks. Michigan Mathematical Journal 6, 59–63
Minieka, E. (1973) Maximal, lexicographic and dynamic network flows. Oper. Res. 2, 517–527
Wilkinson, W.L. (1971) An algorithm for universal maximal dynamic flows in a network. Oper. Res. 7, 1602–1612
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sha, D., Cai, X., Wong, C.K. (2000). The Maximum Flow in a Time-Varying Network. In: Nguyen, V.H., Strodiot, JJ., Tossings, P. (eds) Optimization. Lecture Notes in Economics and Mathematical Systems, vol 481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57014-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-57014-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66905-0
Online ISBN: 978-3-642-57014-8
eBook Packages: Springer Book Archive