Best second order bounds for two-terminal network reliability with dependent edge failures

DOI10.1016/S0166-218X(99)00116-XzbMath0971.90019OpenAlexW2055486120MaRDI QIDQ1961463

Guy-Blaise Douanya Nguetse, Brigitte Jaumard, Pierre Hansen

Publication date: 17 January 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00116-x

zbMATH Keywords

column generationboundstabu search heuristicsprobabilistic graphtwo-terminal reliabilitydependent failuresrow generation integer programming algorithms

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

The diameter and connectivity of networks with random dependent faults, Expected value expansions in rooted graphs

Cites Work

• Algorithms for the maximum satisfiability problem
• Probabilistic logic
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• Probabilistic satisfiability
• A linear programming approach to reasoning about probabilities
• Boole's conditions of possible experience and reasoning under uncertainty
• The Failure Frequency of Systems with Dependent Components
• Improving reliability bounds in computer networks
• First-and second-order bounds on terminal reliability
• L’algebre de Boole et ses applications en recherche operationnelle
• Polynomial algorithms for estimating network reliability
• On the Existence of a Feasible Flow in a Stochastic Transportation Network
• Tabu Search—Part I
• Tabu Search—Part II
• Column Generation Methods for Probabilistic Logic
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• Best Possible Inequalities for the Probability of a Logical Function of Events
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item