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

DOI10.1002/NET.3230170108zbMATH Open0643.90028OpenAlexW2050285799MaRDI QIDQ3786255FDOQ3786255

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

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

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)

Cites Work

• Title not available (Why is that?)
• Solving stochastic programming problems with recourse including error bounds

Cited In (5)

• 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
• Pre-disaster investment decisions for strengthening a highway network
• A two-stage stochastic programming approach for influence maximization in social networks
• Investments in stochastic maximum flow networks

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)