𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial algorithms for estimating network reliability

✍ Scribed by Eitan Zemel

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
751 KB
Volume
12
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We consider the problem of calculating the best possible bounds on the reliability of a system given limited information about the joint density function of its components. We show that a polynomial algorithm for this problem exists iff such an algorithm exists for a certain related problem of minimizing a linear objective function over a clutter. We give numerous examples of network as well as other problems for which the algorithm runs in polynomial time. We also use our construction to prove NP‐hardness for others.

πŸ“œ SIMILAR VOLUMES

Partition-based algorithm for estimating
Partition-based algorithm for estimating transportation network reliability with dependent link failures
✍ Agachai Sumalee; David P. Watling πŸ“‚ Article πŸ“… 2008 πŸ› Institute for Transportation Inc. 🌐 English βš– 133 KB

## Abstract Evaluating the reliability of a transportation network often involves an intensive simulation exercise to randomly generate and evaluate different possible network states. This paper proposes an algorithm to approximate the network reliability which minimizes the use of such simulation

A decomposition algorithm for network re
A decomposition algorithm for network reliability analysis
✍ A. W. Shogan πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 945 KB

## Abstract Consider a directed, source‐sink network whose arcs either function or fail with known probabilities. This paper presents a decomposition algorithm for the exact computation of the reliability of such a network; that is, the probability that there exists a path from the network's source

Balanced network flows. III. Strongly po
Balanced network flows. III. Strongly polynomial augmentation algorithms
✍ Fremuth-Paeger, Christian; Jungnickel, Dieter πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 162 KB

We discuss efficient augmentation algorithms for the maximum balanced flow problem which run in O(nm 2 ) time. More explicitly, we discuss a balanced network search procedure which finds valid augmenting paths of minimum length in linear time. The algorithms are based on the famous cardinality match

A recursive decomposition algorithm for
A recursive decomposition algorithm for network seismic reliability evaluation
✍ Jie Li; Jun He πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 181 KB

## Abstract A new probabilistic analytical approach to evaluate seismic system reliability of large lifeline systems is presented in this paper. The algorithm takes the shortest path from the source to the terminal of a node weight or edge weight network as decomposition policy, using the Boolean l