Maximal Flow in a Multi-Terminal Network with Any One Arc Subject to Failure

A multi-terminal network consists of several demand nodes connected to a common source node through several intermediate nodes. The requirements at the demand nodes are nondecreasing functions of time. It is required to find the maximum time up to which all demands can be satisfied. In this paper two methods are given for solving the problem when the arc capacities are specified. The same problem is also considered for the case in which any one arc of the network may fail, that is, any one arc may assume a specified lower capacity for that arc. An efficient method for solving this problem is also presented.

• 저널Management Science · 18(1) · 48–58
• 토픽Advanced Queuing Theory Analysis · Management Information Systems
• DOI10.1287/mnsc.18.1.48
• 저자P. J. Doulliez, M. R. Rao