Efficient continuous-time dynamic network flow algorithms

摘要

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. (C) 1998 Elsevier Science B.V. All rights reserved. [References: 25]