Pages that link to "Item:Q2005802"
From MaRDI portal
The following pages link to Optimal detection of critical nodes: improvements to model structure and performance (Q2005802):
Displaying 14 items.
- A bio-inspired algorithm for identification of critical components in the transportation networks (Q298402) (← links)
- Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
- An optimal approach for the critical node problem using semidefinite programming (Q1620469) (← links)
- On node criticality in air transportation networks (Q1642936) (← links)
- Improved formulations for minimum connectivity network interdiction problems (Q1652701) (← links)
- Efficient heuristic algorithm for identifying critical nodes in planar networks (Q1734834) (← links)
- Compact models for critical node detection in telecommunication networks (Q1742251) (← links)
- EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Optimal \(K\)-node disruption on a node-capacitated network (Q2311104) (← links)
- Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
- Robust critical node selection by Benders decomposition (Q2806873) (← links)
- Research on the quadratic programming model and solution algorithm of critical nodes in metro network (Q4986076) (← links)
- The stochastic critical node problem over trees (Q6092626) (← links)
