Abstract
Network flows over time form a fascinating area of research. They model the temporal dynamics of network flow problems occurring in a wide variety of applications. Research in this area has been pursued in two different and mainly independent directions with respect to time modeling: discrete and continuous time models. In this paper we deploy measure theory in order to introduce a general model of network flows over time combining both discrete and continuous aspects into a single model. Here, the flow on each arc is modeled as a Borel measure on the real line (time axis) which assigns to each suitable subset a real value, interpreted as the amount of flow entering the arc over the subset. We focus on the maximum flow problem formulated in a network where capacities on arcs are also given as Borel measures and storage might be allowed at the nodes of the network. We generalize the concept of cuts to the case of these Borel Flows and extend the famous MaxFlow-MinCut Theorem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson EJ, Nash P (1987) Linear programming in infinite-dimensional spaces. Wiley, New York
Anderson EJ, Nash P, Philpott AB (1982) A class of continuous network flow problems. Math Oper Res 7: 501–514
Apostol TM (1974) Mathematical analysis, 2nd edn. Addison-Wesley, Reading
Aronson JE (1989) A survey of dynamic network flows. Ann Oper Res 20: 1–66
Conway JB (1990) A course in functional analysis, 2nd edn. Springer, New York
Fleischer LK, Tardos É (1998) Efficient continuous-time dynamic network flow algorithms. Oper Res Lett 23: 71–
Ford LR, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper Res 6: 419–433
Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton
Kingman JFC, Taylor SJ (1966) Introduction to measure and probability. Cambridge University Press, Cambridge
Koch R, Nasrabadi E, Skutella M (2010) Continuous and discrete flows over time. Technical report, Preprint 016-2009, Institut für Mathematik, Technische Universität Berlin, 2009. Revised November 2010
Kotnyek B (2003) An annotated overview of dynamic network flows. Rapport de recherche 4936, INRIA Sophia Antipolis
Lovetskii SE, Melamed II (1987) Dynamic network flows. Automat Remote Control 48:1417–1434. Translated from Avtomatika i Telemekhanika 11:7–29
Nasrabadi E (2009) Dynamic flows in time-varying networks. PhD thesis, Technische Universität Berlin, Berlin
Parthasarathy KR (1967) Probability measures on metric spaces. Academic Press, New York
Philpott AB (1982) Algorithms for continuous network flow problems. PhD thesis, University of Cambridge, UK
Philpott AB (1990) Continuous-time flows in networks. Math Oper Res 15: 640–661
Philpott AB (1994) Continuous-time shortest path problems and linear programming. SIAM J Control Optim 32: 538–552
Powell WB, Jaillet P, Odoni A (1995) Stochastic and dynamic networks and routing. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) Network routing. Handbooks in operations research and management science, vol 8, Chap. 3. North–Holland, Amsterdam, pp 141–295
Skutella M (2009) An introduction to network flows over time. In: Cook W, Lovász L, Vygen J (eds) Research trends in combinatorial optimization. Springer, Berlin, pp 451–482
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by DFG project SK58/7-1.
The first and third author are supported by the DFG Research Center Matheon in Berlin.
Rights and permissions
About this article
Cite this article
Koch, R., Nasrabadi, E. & Skutella, M. Continuous and discrete flows over time. Math Meth Oper Res 73, 301–337 (2011). https://doi.org/10.1007/s00186-011-0357-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-011-0357-2