Investments in stochastic maximum flow networks

DOI10.1007/BF02204863zbMath0737.90023OpenAlexW2077073205MaRDI QIDQ1176860

Richard D. Wollmer

Publication date: 25 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02204863

zbMATH Keywords

investmentmaximum flowexpected maximum network flowrandom arc capacitiestwo-stage stochastic linear program

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

A two-stage stochastic programming approach for influence maximization in social networks ⋮ Pre-disaster investment decisions for strengthening a highway network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Maximal Flow Through a Network
• The Cutting-Plane Method for Solving Convex Programs
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
• Investing in arcs in a network to maximize the expected max flow
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Maximum flow in probabilistic graphs-the discrete case
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Programming Under Uncertainty: The Equivalent Convex Program
• Linear programming under uncertainty: A basic property of the optimal solution
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• Stochastic Programs with Recourse
• Cutting-Plane Methods without Nested Constraint Sets
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

This page was built for publication: Investments in stochastic maximum flow networks