Polynomial algorithms for estimating network reliability

DOI10.1002/net.3230120408zbMath0494.90034OpenAlexW2001832122WikidataQ92190492 ScholiaQ92190492MaRDI QIDQ3958250

Eitan Zemel

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/449.pdf

zbMATH Keywords

polynomial algorithmlimited informationreliability boundscalculation of boundsestimation of network reliabilityunreliable system components

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Extremal Probability Bounds in Combinatorial Optimization, Boole's conditions of possible experience and reasoning under uncertainty, Lower bounds on two-terminal network reliability, Polynomial-time algorithms for multimarginal optimal transport problems with structure, Network reliability: Heading out on the highway, Best second order bounds for two-terminal network reliability with dependent edge failures, On search over rationals, Polynomially Computable Bounds for the Probability of the Union of Events, Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem

Cites Work

• Unnamed Item
• Paths, Trees, and Flowers
• Optimum branchings