Algorithms for the quickest time distribution of dynamic stochastic-flow networks (Q4578177): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1051/ro/2016073 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1051/ro/2016073 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2549026862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the performance index of a telecommunication network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dynamic network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest flow 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: The quickest path problem / 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: Q4737515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quickest Transshipment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic bounding algorithm for approximating multi-state two-terminal reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sum of disjoint products algorithm for reliability evaluation of flow networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all-pairs quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Evaluation of a Flow Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach / 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: A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities / 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: Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable and Restricted Quickest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Universal Maximal Dynamic Flows in a Network / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/RO/2016073 / rank
 
Normal rank

Latest revision as of 14:45, 30 December 2024

scientific article; zbMATH DE number 6914637
Language Label Description Also known as
English
Algorithms for the quickest time distribution of dynamic stochastic-flow networks
scientific article; zbMATH DE number 6914637

    Statements

    Algorithms for the quickest time distribution of dynamic stochastic-flow networks (English)
    0 references
    0 references
    0 references
    8 August 2018
    0 references
    dynamic stochastic-flow network
    0 references
    quickest time distribution
    0 references
    decomposition algorithm
    0 references
    reliability
    0 references

    Identifiers

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