Pages that link to "Item:Q947931"
From MaRDI portal
The following pages link to Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931):
Displayed 20 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)
- 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)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
- A NEW MODEL FOR DESCRIBING EVOLUTION AND CONTROL OF DISASTER SYSTEM INCLUDING INSTANTANEOUS AND CONTINUOUS ACTIONS (Q3560141) (← links)
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
- Selected Topics in Critical Element Detection (Q5260999) (← links)