On the Maximum Expected Flow in a Network

DOI10.1057/jors.1988.82zbMath0641.90040OpenAlexW2002917599MaRDI QIDQ3783059

N. G. F. Sancho

Publication date: 1988

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1988.82

zbMATH Keywords

graphreliabilitycapacityexpected flowmaximum expected flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Related Items

Multiobjective routing of hazardous materials in stochastic networks, The value of information in stochastic maximum flow problems, Routing with nonlinear multiattribute cost functions, On finding dissimilar Pareto-optimal paths