%0 Book Section %1 skutella_introduction_2009 %A Skutella, Martin %B Research Trends in Combinatorial Optimization %D 2009 %I Springer-Verlag %K imported network-flows %P 451--482 %T An Introduction to Network Flows over Time %U http://dx.doi.org/10.1007/978-3-540-76796-1_21 %X We give an introduction into the fascinating area of flows over time—also called “dynamic flows” in the literature. Starting from the early work of Ford and Fulkerson on maximum flows over time, we cover many exciting results that have been obtained over the last fifty years. One purpose of this chapter is to serve as a possible basis for teaching network flows over time in an advanced course on combinatorial optimization.

@incollection{skutella_introduction_2009, abstract = {We give an introduction into the fascinating area of flows over time—also called “dynamic flows” in the literature. Starting from the early work of Ford and Fulkerson on maximum flows over time, we cover many exciting results that have been obtained over the last fifty years. One purpose of this chapter is to serve as a possible basis for teaching network flows over time in an advanced course on combinatorial optimization.}, added-at = {2009-10-12T12:20:34.000+0200}, author = {Skutella, Martin}, biburl = {https://www.bibsonomy.org/bibtex/2c7db8d2507414ea10bc845e737fc11fa/cgray}, booktitle = {Research Trends in Combinatorial Optimization}, interhash = {72ec12f4cfc1c07677e2190fe1d4fbba}, intrahash = {c7db8d2507414ea10bc845e737fc11fa}, keywords = {imported network-flows}, pages = {451--482}, publisher = {{Springer-Verlag}}, timestamp = {2009-10-13T16:48:38.000+0200}, title = {An Introduction to Network Flows over Time}, url = {http://dx.doi.org/10.1007/978-3-540-76796-1_21}, year = 2009 }