Pages that link to "Item:Q947931"

The following pages link to Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931):

Displaying 38 items.

• A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions (Q264305) (← links)
• Models, solutions and enabling technologies in humanitarian logistics (Q319284) (← links)
• Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
• Robustness of power-law networks: its assessment and optimization (Q326464) (← links)
• A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics (Q336844) (← links)
• Characterizing multi-event disaster resilience (Q336861) (← links)
• Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
• Bound and exact methods for assessing link vulnerability in complex networks (Q405658) (← links)
• An integer programming framework for critical elements detection in graphs (Q405684) (← links)
• Assessing the reliability and the expected performance of a network under disaster risk (Q647517) (← links)
• A disaster-severity assessment DSS comparative analysis (Q647520) (← links)
• Risk approaches for delivering disaster relief supplies (Q647529) (← links)
• Strategic network restoration (Q993462) (← links)
• Detecting critical nodes in sparse graphs (Q1013394) (← links)
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
• A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
• Component importance measures for multi-industry vulnerability of a freight transportation network (Q1654570) (← links)
• Optimizing network robustness by edge rewiring: a general framework (Q1741288) (← links)
• Systems under attack-survivability rather than reliability: concept, results, and applications (Q1751760) (← links)
• A general methodology for data-based rule building and its application to natural disaster management (Q1762053) (← links)
• Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
• Optimal detection of critical nodes: improvements to model structure and performance (Q2005802) (← links)
• Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
• Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions (Q2178373) (← links)
• Network interdiction with asymmetric cost uncertainty (Q2242212) (← links)
• Optimal \(K\)-node disruption on a node-capacitated network (Q2311104) (← links)
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
• Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• The connected critical node problem (Q2672625) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Finding Critical Links for Closeness Centrality (Q5138269) (← links)
• Research communities in cyber security vulnerability assessments: a comprehensive literature review (Q6101354) (← links)
• EFFECT OF TRAFFIC DEMAND VARIATION ON ROAD NETWORK RESILIENCE (Q6121965) (← links)
• A two‐stage network interdiction‐monitoring game (Q6179685) (← links)