Investing in arcs in a network to maximize the expected max flow

This publication has 15 references indexed in Scilit:

• Bounds on expected performance of networks with links subject to failure
  Networks, 1984
• An O(K·n4) algorithm for finding the k best cuts in a network
  Operations Research Letters, 1982
• Maximum flow in networks with a small number of random arc capacities
  Networks, 1982
• Solving stochastic programming problems with recourse including error bounds
  Mathematische Operationsforschung und Statistik. Series Optimization, 1982
• Maximal expected flow in a network subject to arc failures
  Networks, 1980
• Maximum flow in probabilistic graphs‐the discrete case
  Networks, 1976
• An Implicit Enumeration Scheme for Proper Cut Generation
  Technometrics, 1970
• Bounds on the average terminal capacity of probabilistic nets (Corresp.)
  IEEE Transactions on Information Theory, 1968
• Programming Under Uncertainty: The Equivalent Convex Program
  SIAM Journal on Applied Mathematics, 1966
• Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
  The Annals of Mathematical Statistics, 1959