Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation (Q2150813): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two stage design for estimating the reliability of series/parallel systems / 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: Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the \(k\) quickest paths in a network / 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: On the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria path and tree problems: discussion on exact algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for the biobjective shortest path problem for large-scale road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte Carlo Sampling Plan for Estimating Network Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for finding all upper boundary points in a stochastic-flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all-pairs quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic flow networks via multiple paths under time threshold and budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability / 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: A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min‐Max quickest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-confidence estimation of small <i>s</i> -<i>t</i> reliabilities in directed acyclic networks / rank
 
Normal rank

Latest revision as of 12:54, 29 July 2024

scientific article
Language Label Description Also known as
English
Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
scientific article

    Statements

    Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    spare routing
    0 references
    budget
    0 references
    Monte Carlo simulation
    0 references
    reliability
    0 references
    intersectional minimal paths
    0 references
    0 references
    0 references