Network augmentation for disaster‐resilience against geographically correlated failure

DOI10.1002/net.22138zbMath1530.90029OpenAlexW4311876104MaRDI QIDQ6179691

Marcus Brazil, Charl J. Ras, Nicolau Andrés-Thió, Doreen Anne Thomas

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22138

zbMATH Keywords

heuristicsaugmentationedge-cutdisaster resilienceblock-cut treesgeographically correlated failure

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network
• Edge-connectivity augmentation problems
• Minimum weight connectivity augmentation for planar straight-line graphs
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Planar Biconnectivity Augmentation with Fixed Embedding
• Augmentation Problems
• Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree

This page was built for publication: Network augmentation for disaster‐resilience against geographically correlated failure