A New Algorithms for the Time-Varying Maximum Flow Problem

摘要

The maximum flow problem is one of network optimization problems which has been studied widely. The problem could be thought of static, since both the arc capacity and the node capacity in the given network are constant. An extension of the problem is called the maximal dynamic flow problem which is formulated and solved by Ford et al (1962), where the transit time to traverse an arc is taken into consideration.