Topological optimization of reliable networks under dependent failures
From MaRDI portal
Publication:1785625
DOI10.1016/j.orl.2014.12.014zbMath1408.90048OpenAlexW2027492955WikidataQ57707460 ScholiaQ57707460MaRDI QIDQ1785625
Héctor Cancela, Javiera Barrera, Eduardo Moreno
Publication date: 1 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2014.12.014
Integer programming (90C10) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (6)
Sixty years of network reliability ⋮ Network Design with Service Requirements: Scaling-up the Size of Solvable Problems ⋮ An efficient alternative to the exact evaluation of the quickest path flow network reliability problem ⋮ Exact reliability optimization for series‐parallel graphs using convex envelopes ⋮ Uniformly optimally reliable graphs: A survey ⋮ Optimization algorithms for resilient path selection in networks
Uses Software
Cites Work
- Unnamed Item
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- On exchangeable, causal and cascading failures
- The empirical behavior of sampling methods for stochastic programming
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- A Bivariate Extension of the Exponential Distribution
- Computational Complexity of Network Reliability Analysis: An Overview
- Reliability Evaluation in Computer-Communication Networks
- Topological optimization of a communication network subject to a reliability constraint
- A simple min-cut algorithm
- A Multivariate Exponential Distribution
This page was built for publication: Topological optimization of reliable networks under dependent failures
