Polyhedral Combinatorics and Network Reliability

DOI10.1287/MOOR.11.1.36MaRDI QIDQ3731354zbMATH OpenOpenAlexFDO

Authors J. Scott Provan

Publication date 1986

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.11.1.36

zbMATH Keywords

network reliabilitypolyhedral combinatoricsrandom failurereliability of systemsreliability polynomialstochastic networksupper and lower bounds

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Reliability, availability, maintenance, inspection in operations research (90B25) Integer programming (90C10) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 3947973
• Network reliability
• Calculating bounds on reachability and connectedness in stochastic networks
• scientific article; zbMATH DE number 49666
• Bounds on the Reliability of Networks

Cited in

(11)

• Chromatic polynomials and network reliability
• A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability
• On extreme disentanglement of clutters in the Polesskii estimates of the boundaries of combinatorial reliability of random binary systems
• Combinatorial and Geometric View of the System Reliability Theory
• scientific article; zbMATH DE number 4053686 (Why is no real title available?)
• Optimal design modifications by geometric programming and constrained stochastic network models
• scientific article; zbMATH DE number 176258 (Why is no real title available?)
• scientific article; zbMATH DE number 1058054 (Why is no real title available?)
• Cohen–Macaulay Rings in Network Reliability
• A characterization of network representable polymatroids
• Network reliability: Heading out on the highway

This page was built for publication: Polyhedral Combinatorics and Network Reliability

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