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

Pierre J. Doulliez and M. R. Rao
Additional contact information
Pierre J. Doulliez: Société de Traction et d'Electricité, Brussels, Belgium
M. R. Rao: University of Rochester

Management Science, 1971, vol. 18, issue 1, 48-58

Abstract: 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.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.1.48 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:18:y:1971:i:1:p:48-58

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().