Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks

DOI10.1016/j.ejor.2016.12.030zbMath1402.90041OpenAlexW2564452081MaRDI QIDQ1751923

Yih-Wenn Laih, Chin-Chia Jane

Publication date: 25 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.12.030

zbMATH Keywords

distributionreliabilityapplied probabilitytransit timemulti-state flow network

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (3)

Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast and fine quickest path algorithm
• An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
• Internet packet routing: application of a \(K\)-quickest path algorithm
• The quickest path problem
• A survey of dynamic network flows
• A dynamic bounding algorithm for approximating multi-state two-terminal reliability
• 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
• Evaluating cost and reliability integrated performance of stochastic logistics systems
• A new approach to the maximum-flow problem
• The quickest flow problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
• PERMUTATIONAL METHODS FOR PERFORMANCE ANALYSIS OF STOCHASTIC FLOW NETWORKS
• A sum of disjoint products algorithm for reliability evaluation of flow networks

This page was built for publication: Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks