Pages that link to "Item:Q1877897"
From MaRDI portal
The following pages link to A cutting plane algorithm for computing \(k\)-edge survivability of a network (Q1877897):
Displaying 17 items.
- Optimizing dynamic investment decisions for railway systems protection (Q320718) (← links)
- Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
- Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931) (← links)
- Detecting critical nodes in sparse graphs (Q1013394) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Systems under attack-survivability rather than reliability: concept, results, and applications (Q1751760) (← 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)
- 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)
- Circular and radial design comparison of survivability in asymmetrical hierarchical networks (Q2885521) (← 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)
- Selected Topics in Critical Element Detection (Q5260999) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
