The value of information in stochastic maximum flow problems

DOI10.1016/j.cor.2013.01.004zbMath1348.90167OpenAlexW2065590751MaRDI QIDQ336360

S. Mehdi Hashemi, Ebrahim Nasrabadi, Rasool Tahmasbi

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.004

zbMATH Keywords

value of informationnetwork flowsstochastic networksstatistical simulation

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Stochastic network models in operations research (90B15)

Related Items (1)

Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms

Cites Work

• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems
• Bounds on expected performance of networks with links subject to failure
• Communication and transportation network reliability using routing models
• Computational Complexity of Network Reliability Analysis: An Overview
• Efficient algorithms for reliability analysis of planar networks - a survey
• On the Maximum Expected Flow in a Network
• Maximal expected flow in a network subject to arc failures
• Maximum flows in probabilistic networks
• Maximum flow in probabilistic graphs-the discrete case
• Maximizing residual flow under an arc destruction
• The maximum residual flow problem: NP‐hardness with two‐arc destruction
• Bounds on the average terminal capacity of probabilistic nets (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The value of information in stochastic maximum flow problems