Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks

DOI10.1155/2019/4561845zbMath1421.90038OpenAlexW2924421263MaRDI QIDQ2325146

Qing Li, Xiu-Zhen Xu, Yi-Feng Niu

Publication date: 9 September 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/4561845

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (2)

A minimal path-based method for computing multistate network reliability ⋮ Reliability evaluation in terms of flow data mining for multistate networks

Cites Work

• Unnamed Item
• Unnamed Item
• Modeling gene networks in \textit{Saccharomyces cerevisiae} based on gene expression profiles
• A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
• Computational investigations of maximum flow algorithms
• \(H_\infty\) synchronization of semi-Markovian jump neural networks with randomly occurring time-varying delays
• Event-triggered control for the stabilization of probabilistic Boolean control networks
• Fuzzy control model and simulation for nonlinear supply chain system with lead times
• Approximate method to evaluate reliability of complex networks
• Novel model for cascading failure based on degree strength and its application in directed gene logic networks
• Analysis for gene networks based on logic relationships
• Reliability assessment of a multistate freight network for perishable merchandise with multiple suppliers and buyers
• Evaluating cost and reliability integrated performance of stochastic logistics systems
• A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure

This page was built for publication: Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks