The following pages link to A problem in network interdiction (Q4177291):
Displaying 42 items.
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- Matching interdiction (Q602686) (← links)
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931) (← links)
- Interdicting the activities of a linear program -- a parametric analysis (Q1390246) (← links)
- A bilevel programming model for proactive countermeasure selection in complex ICT systems (Q1742246) (← links)
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources (Q1761829) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Finding the most vital arcs in a network (Q1823164) (← links)
- The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
- New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Network interdiction with asymmetric cost uncertainty (Q2242212) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
- An exact solution approach for the interdiction median problem with fortification (Q2477666) (← links)
- Heuristics for multi-stage interdiction of stochastic networks (Q2491320) (← links)
- Risk-Averse Shortest Path Interdiction (Q2830955) (← links)
- Minimizing a stochastic maximum-reliability path (Q3184595) (← links)
- Reformulation and sampling to solve a stochastic network interdiction problem (Q3184597) (← links)
- Shortest path network interdiction with asymmetric information (Q3184598) (← links)
- A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- Deception tactics for network interdiction: A multiobjective approach (Q4648690) (← links)
- (Q5002612) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction (Q5090156) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
- Shortest path interdiction problem with convex piecewise-linear costs (Q6080429) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set (Q6179697) (← links)
- Attack and interception in networks (Q6180414) (← links)
- Computation of Nash equilibria of attack and defense games on networks (Q6546276) (← links)
