An efficient alternative to the exact evaluation of the quickest path flow network reliability problem (Q342541): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Topological optimization of reliable networks under dependent failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new importance sampling Monte Carlo method for a flow network reliability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem with interval lead times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the quickest path problem and the reliable quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new simulation method based on the RVR principle for the rare event network reliability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3629719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the constrained quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(k\) quickest simple paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Monte Carlo Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4730664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2737800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all-pairs quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic computer network under accuracy rate constraint from QoS viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for ranking quickest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive survey on the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transform likelihood ratio method for rare event simulation with heavy tails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable and Restricted Quickest Path Problems / rank
 
Normal rank

Revision as of 23:03, 12 July 2024

scientific article
Language Label Description Also known as
English
An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
scientific article

    Statements

    An efficient alternative to the exact evaluation of the quickest path flow network reliability problem (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    arc capacity
    0 references
    arc lead time
    0 references
    flow network
    0 references
    inclusion-exclusion
    0 references
    minimal path
    0 references
    Monte-Carlo simulation
    0 references
    path capacity
    0 references
    path lead time
    0 references
    path transmission time
    0 references
    quickest path
    0 references
    reliability
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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