Maximal expected flow in a network subject to arc failures

DOI10.1002/net.3230100105zbMath0432.90073OpenAlexW2014377998MaRDI QIDQ3870689

K. P. K. Nair, Yash P. Aneja

Publication date: 1980

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230100105

zbMATH Keywords

algorithmgeometric interpretationarc failuresflows in networkscolumn generation techniquecomputation of optimal solutionmaximal expected flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Deterministic network models in operations research (90B10)

Related Items

The value of information in stochastic maximum flow problems, Network reliability: Heading out on the highway, Parametric min-cuts analysis in a network., Network flows with age dependent decay rates

Cites Work

• Unnamed Item