Algebraic methods applied to shortest path and maximum flow problems in stochastic networks (Q5326783): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State space partitioning methods for stochastic shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing stochastic flow networks using the monte carlo method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836494 / 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: State‐space partition techniques for multiterminal flows in stochastic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Project Completion Time Distribution in PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4777030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Association of Random Variables, with Applications / 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: The Distribution of Maximum Flow with Applications to Multistate Reliability Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected Critical Path Lengths in PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended dominance and a stochastic shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding Distributions for a Stochastic Acyclic Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of a Technique for Research and Development Program Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum flows in probabilistic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A paradigm for listing \((s,t)\)-cuts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding distributions for a stochastic pert network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stochastic Shortest Route Problem / rank
 
Normal rank

Latest revision as of 17:10, 6 July 2024

scientific article; zbMATH DE number 6195678
Language Label Description Also known as
English
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
scientific article; zbMATH DE number 6195678

    Statements

    Algebraic methods applied to shortest path and maximum flow problems in stochastic networks (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    algebraic
    0 references
    majorization
    0 references
    maximum flow
    0 references
    minimum cut
    0 references
    shortest path
    0 references
    stochastic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references