Polyhedral Combinatorics and Network Reliability

DOI10.1287/moor.11.1.36zbMath0597.90040OpenAlexW2017398159MaRDI QIDQ3731354

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

upper and lower boundsstochastic networksnetwork reliabilitypolyhedral combinatoricsreliability polynomialrandom failurereliability of systems

Mathematics Subject Classification ID

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

Related Items (2)

Network reliability: Heading out on the highway ⋮ Optimal design modifications by geometric programming and constrained stochastic network models

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