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 tw...

Full description

Saved in:
Bibliographic Details
Published inManagement science Vol. 18; no. 1; pp. 48 - 58
Main Authors Doulliez, Pierre J, Rao, M. R
Format Journal Article
LanguageEnglish
Published Hanover, MD., etc INFORMS 01.09.1971
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
SeriesManagement Science
Subjects
Algorithms
Flow coefficients
Leaves
Linear programming
Mathematical procedures
Maximum value
Optimal solutions
Simplex method
Tableaux
Variable coefficients
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.18.1.48