Computing Network Reliability
From MaRDI portal
Publication:4199816
DOI10.1287/opre.27.4.823zbMath0412.90030OpenAlexW2106573360MaRDI QIDQ4199816
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.4.823
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Reliability and life testing (62N05)
Related Items
Integrating reliability and quality of service in networks with switched virtual circuits, Application of Path Counting Problem and Survivability Function in Analysis of Social Systems, Sharing the cost of risky projects, Applying path-counting methods for measuring the robustness of the network-structured system, Optimizing Network Topology for Cascade Resilience, Finding the probability of infection in an SIR network is NP-hard, Counting almost minimum cutsets with reliability applications, Sharing the cost of redundant items, A multiple criteria model for the allocation of data files in a distributed information system, Determination of path identifiers for reliability analysis of a broadcasting network using Petri nets, An algorithm for network dimensioning under reliability considerations, Design of reliable networks, On computing the 2‐diameter ‐constrained K ‐reliability of networks, A dynamic bounding algorithm for approximating multi-state two-terminal reliability, Connectivity, stability and efficiency in a network as an information flow, Low earth orbit satellite based communication systems -- research opportunities, Bounds on the Reliability Polynomial for Shellable Independence Systems
