Algorithms for the quickest time distribution of dynamic stochastic-flow networks

DOI10.1051/ro/2016073zbMath1392.05049OpenAlexW2549026862MaRDI QIDQ4578177

Chin-Chia Jane, Yih-Wenn Laih

Publication date: 8 August 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2016073

zbMATH Keywords

reliabilitydecomposition algorithmdynamic stochastic-flow networkquickest time distribution

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (2)

Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search ⋮ Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute

Cites Work

• Unnamed Item
• Unnamed Item
• The quickest path problem
• A survey of dynamic network flows
• A dynamic bounding algorithm for approximating multi-state two-terminal reliability
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Finding the \(k\) quickest simple paths in a network
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• The all-pairs quickest path problem
• The Quickest Transshipment Problem
• Reliable and Restricted Quickest Path Problems
• A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities
• Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes
• A fast algorithm for the performance index of a telecommunication network
• The quickest flow problem
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Reliability Evaluation of a Flow Network
• A sum of disjoint products algorithm for reliability evaluation of flow networks

This page was built for publication: Algorithms for the quickest time distribution of dynamic stochastic-flow networks