The value of information in stochastic maximum flow problems

DOI10.1016/J.COR.2013.01.004zbMATH Open1348.90167OpenAlexW2065590751MaRDI QIDQ336360FDOQ336360

Authors: Rasool Tahmasbi, Ebrahim Nasrabadi, S. Mehdi Hashemi 

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

Recommendations

• Maximum flows in probabilistic networks
• Evaluating Reliability of Stochastic Flow Networks
• A mean-variance model for the minimum cost flow problem with stochastic arc costs
• Investments in stochastic maximum flow networks
• The maximum flow problem of uncertain network

zbMATH Keywords

network flowsstochastic networksvalue of informationstatistical simulation

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• A suggested computation for maximal multi-commodity network flows
• Bounds on expected performance of networks with links subject to failure
• Computational Complexity of Network Reliability Analysis: An Overview
• Algebraic methods for stochastic minimum cut and maximum flow problems
• Communication and transportation network reliability using routing models
• Models of network reliability. Analysis, combinatorics, and Monte Carlo.
• 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
• Title not available (Why is that?)
• The maximum residual flow problem: NP‐hardness with two‐arc destruction
• Bounds on the average terminal capacity of probabilistic nets (Corresp.)

Cited In (4)

• The Value of Side Information in Shortest Path Optimization
• The value of side information in network flow optimization
• Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
• Investing in arcs in a network to maximize the expected max flow

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

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