Overall-terminal reliability of a stochastic capacitated-flow network.

DOI10.1016/S0895-7177(02)00113-9zbMath1129.90314OpenAlexW2088178132MaRDI QIDQ1410084

Yi-Kuei Lin

Publication date: 14 October 2003

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(02)00113-9

zbMATH Keywords

ReliabilityCapacityMinimal pathNetwork flowOverall-terminal

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (4)

Integral representations for the Lagrange polynomials, Shively's pseudo-Laguerre polynomials, and the generalized Bessel polynomials ⋮ Some families of generating functions for a certain class of three-variable polynomials ⋮ Some families of hypergeometric polynomials and associated multiple integral representations ⋮ Families of linear generating functions for polynomials in two variables

Cites Work

• Unnamed Item
• Unnamed Item
• Reliability Bounds for Multistate Systems with Multistate Components
• Reliability Evaluation of Multistate Systems with Multistate Components
• Capacity Consideration in Reliability Analysis of Communication Systems
• Maximum flow in probabilistic graphs-the discrete case
• An Improved Algorithm for Network Reliability
• 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
• Multistate reliability models
• Study on the multicommodity reliability of a capacitated-flow network
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure

This page was built for publication: Overall-terminal reliability of a stochastic capacitated-flow network.