| Article ID: | iaor2001971 |
| Volume: | 23 |
| Issue: | 3/5 |
| Start Page Number: | 71 |
| End Page Number: | 80 |
| Publication Date: | Oct 1998 |
| Journal: | Operations Research Letters |
| Authors: | Tardos E., Fleischer L. |
We extend discrete-time dynamic flow algorithms presented in the literature to solve the analogous continuous-time dynamic flow problems. These problems include finding maximum dynamic flows, quickest flows, universally maximum dynamic flows, lexicographically maximum dynamic flows, dynamic transshipments, and quickest transshipments in networks with capacities and transit times on the edges.