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

DOI10.1002/NET.3230170108MaRDI QIDQ3786255zbMATHOpenAlexFDO

Authors Stein W. Wallace

Publication date 1987

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

approximationsnetwork recourseunreliable arcsexpected max flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic programming (90C15)

Recommendations

• Investments in stochastic maximum flow networks
• A class of chance constrained network optimization problems
• The value of information in stochastic maximum flow problems
• Stochastic programs over trees with random arc capacities
• Maximum flows in probabilistic networks

Cites work

• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• Solving stochastic programming problems with recourse including error bounds

Cited in

(5)

• Pre-disaster investment decisions for strengthening a highway network
• A two-stage stochastic programming approach for influence maximization in social networks
• Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
• Solving many linear programs that differ only in the right-hand side
• Investments in stochastic maximum flow networks

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Investing in arcs in a network to maximize the expected max flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786255)