Polynomial algorithms for estimating network reliability

DOI10.1002/NET.3230120408MaRDI QIDQ3958250zbMATH OpenOpenAlexWikidataFDO

Authors 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

calculation of boundsestimation of network reliabilitylimited informationpolynomial algorithmreliability boundsunreliable system components

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimum branchings
• Paths, Trees, and Flowers

Cited in

(9)

• 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
• 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
• Network reliability: Heading out on the highway

This page was built for publication: Polynomial algorithms for estimating network reliability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3958250)