Polynomial algorithms for estimating network reliability
From MaRDI portal
Publication:3958250
DOI10.1002/net.3230120408zbMath0494.90034WikidataQ92190492 ScholiaQ92190492MaRDI QIDQ3958250
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
polynomial algorithm; limited information; reliability bounds; calculation of bounds; estimation of network reliability; unreliable system components
68Q25: Analysis of algorithms and problem complexity
90C90: Applications of mathematical programming
90B25: Reliability, availability, maintenance, inspection in operations research
Related Items
Extremal Probability Bounds in Combinatorial Optimization, Polynomially Computable Bounds for the Probability of the Union of Events, Polynomial-time algorithms for multimarginal optimal transport problems with structure, Lower bounds on two-terminal network reliability, On search over rationals, Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem, Boole's conditions of possible experience and reasoning under uncertainty, Best second order bounds for two-terminal network reliability with dependent edge failures
Cites Work
