Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
From MaRDI portal
Publication:947931
DOI10.1016/j.cor.2007.09.004zbMath1163.90441OpenAlexW2123785786MaRDI QIDQ947931
Timothy C. Matisziw, Alan T. Murray
Publication date: 8 October 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.09.004
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (40)
A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions ⋮ Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem ⋮ Models, solutions and enabling technologies in humanitarian logistics ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ Robustness of power-law networks: its assessment and optimization ⋮ A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics ⋮ Characterizing multi-event disaster resilience ⋮ A mixed-integer programming approach for locating jamming devices in a flow-jamming attack ⋮ Methods for removing links in a network to minimize the spread of infections ⋮ Component importance measures for multi-industry vulnerability of a freight transportation network ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Solving the Distance-Based Critical Node Problem ⋮ Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ Integer programming methods for solving binary interdiction games ⋮ The connected critical node problem ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ Bound and exact methods for assessing link vulnerability in complex networks ⋮ An integer programming framework for critical elements detection in graphs ⋮ Research communities in cyber security vulnerability assessments: a comprehensive literature review ⋮ EFFECT OF TRAFFIC DEMAND VARIATION ON ROAD NETWORK RESILIENCE ⋮ A two‐stage network interdiction‐monitoring game ⋮ Assessing the reliability and the expected performance of a network under disaster risk ⋮ A disaster-severity assessment DSS comparative analysis ⋮ Risk approaches for delivering disaster relief supplies ⋮ Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth ⋮ Finding Critical Links for Closeness Centrality ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Optimizing network robustness by edge rewiring: a general framework ⋮ A NEW MODEL FOR DESCRIBING EVOLUTION AND CONTROL OF DISASTER SYSTEM INCLUDING INSTANTANEOUS AND CONTINUOUS ACTIONS ⋮ Network interdiction with asymmetric cost uncertainty ⋮ Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs ⋮ Systems under attack-survivability rather than reliability: concept, results, and applications ⋮ A general methodology for data-based rule building and its application to natural disaster management ⋮ Optimal detection of critical nodes: improvements to model structure and performance ⋮ Strategic network restoration ⋮ Detecting critical nodes in sparse graphs ⋮ Optimal \(K\)-node disruption on a node-capacitated network ⋮ Selected Topics in Critical Element Detection
Uses Software
Cites Work
- Most vital links and nodes in weighted networks
- Deterministic network interdiction
- Finding the most vital arcs in a network
- Using formal MS/OR modeling to support disaster recovery planning
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- BEAMR: an exact and approximate model for the \(p\)-median problem
- Stochastic Network Interdiction
- Optimal attack and reinforcement of a network
- Finding the n Most Vital Links in Flow Networks
- Finding the n Most Vital Nodes in a Flow Network
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- Shortest-path network interdiction
- Removing Arcs from a Network
- Optimal interdiction of a supply network
This page was built for publication: Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
