Pages that link to "Item:Q4994144"
From MaRDI portal
The following pages link to The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms (Q4994144):
Displaying 14 items.
- The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm (Q339605) (← links)
- On the power of randomization in network interdiction (Q1785482) (← links)
- Network interdiction with asymmetric cost uncertainty (Q2242212) (← links)
- Risk-averse shortest path interdiction (Q2830955) (← links)
- Exact algorithms and bounds for the dynamic assignment interdiction problem (Q4632979) (← links)
- Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
- Shortest-path network interdiction (Q4785225) (← links)
- Sequential Interdiction with Incomplete Information and Learning (Q4971578) (← links)
- Shortest path interdiction problem with arc improvement recourse: A multiobjective approach (Q5226166) (← links)
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback (Q5868922) (← links)
- A two‐stage network interdiction‐monitoring game (Q6179685) (← links)
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set (Q6179697) (← links)
- Shortest path network interdiction with incomplete information: a robust optimization approach (Q6547018) (← links)
- The all-pairs vitality-maximization (VIMAX) problem (Q6588518) (← links)
