Pages that link to "Item:Q1727948"
From MaRDI portal
The following pages link to Protection of flows under targeted attacks (Q1727948):
Displaying 15 items.
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model (Q342516) (← links)
- Net-flow fingerprint model based on optimization theory (Q1639392) (← links)
- Filtering undesirable flows in networks (Q1699751) (← links)
- Bilevel model for adaptive network flow problem (Q1742209) (← links)
- Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
- The complexity of computing a robust flow (Q2294522) (← links)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case (Q2309467) (← links)
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold (Q2311034) (← links)
- Survivable network design under optimal and heuristic interdiction scenarios (Q2460119) (← links)
- An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
- Rerouting Flows when Links Fail (Q5128505) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
