The value of information in stochastic maximum flow problems (Q336360): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2013.01.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065590751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on expected performance of networks with links subject to failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3569540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication and transportation network reliability using routing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum flow in probabilistic graphs-the discrete case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for reliability analysis of planar networks - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the average terminal capacity of probabilistic nets (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum flows in probabilistic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal expected flow in a network subject to arc failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Expected Flow in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing residual flow under an arc destruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum residual flow problem: <i>NP</i>‐hardness with two‐arc destruction / rank
 
Normal rank

Latest revision as of 22:38, 12 July 2024

scientific article
Language Label Description Also known as
English
The value of information in stochastic maximum flow problems
scientific article

    Statements

    The value of information in stochastic maximum flow problems (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    network flows
    0 references
    stochastic networks
    0 references
    value of information
    0 references
    statistical simulation
    0 references

    Identifiers