Stochastic network interdiction
From MaRDI portal
Cited in
(97)- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- Models of the optimal resource allocation for the critical infrastructure protection
- A study of network violator interception based on a reliable game model
- Protection of flows under targeted attacks
- The maximum clique interdiction problem
- Optimization models of anti-terrorist protection
- Bilevel model for adaptive network flow problem
- Risk-averse stochastic path detection
- An interdiction game on a queueing network with multiple intruders
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- On the power of randomization in network interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- The stochastic interdiction median problem with disruption intensity levels
- Models and methods for solving the problem of network vulnerability
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Network interdiction with asymmetric cost uncertainty
- Convex hull representation of the deterministic bipartite network interdiction problem
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- A survey of network interdiction models and algorithms
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- Designing networks with resiliency to edge failures using two-stage robust optimization
- Solving multi-period interdiction via generalized Bender's decomposition
- A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty
- Survivable network design under optimal and heuristic interdiction scenarios
- A bilevel mixed-integer program for critical infrastructure protection planning
- Jamming communication networks under complete uncertainty
- Heuristics for multi-stage interdiction of stochastic networks
- SPAR: Stochastic Programming with Adversarial Recourse
- An iterative security game for computing robust and adaptive network flows
- Integer programming methods for solving binary interdiction games
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
- Risk-averse shortest path interdiction
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- Optimizing dynamic investment decisions for railway systems protection
- A brief overview of interdiction and robust optimization
- Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption
- Protection issues for supply systems involving random attacks
- Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction
- The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
- Applying ranking and selection procedures to long-term mitigation for improved network restoration
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- Optimization under decision-dependent uncertainty
- Deception tactics for network interdiction: a multiobjective approach
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Sequential Shortest Path Interdiction with Incomplete Information
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- A unified framework for multistage mixed integer linear optimization
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games
- Network inspection for detecting strategic attacks
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Analysis of budget for interdiction on multicommodity network flows
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- A computational approach to determine damage in infrastructure networks from outage reports
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- The stochastic critical node problem over trees
- A survey on bilevel optimization under uncertainty
- Interdicting restructuring networks with applications in illicit trafficking
- A survey on mixed-integer programming techniques in bilevel optimization
- Parametric matroid interdiction
- Designing robust coverage networks to hedge against worst-case facility losses
- A two‐stage network interdiction‐monitoring game
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
- A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions
- Network deployment of radiation detectors with physics-based detection probability calculations
- Shortest path network interdiction with incomplete information: a robust optimization approach
- The all-pairs vitality-maximization (VIMAX) problem
- Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach
- Stability of interdiction strategies in quickest flow networks
- Multi-stage network interdiction with decision-dependent success: scenario clustering and reformulation techniques
- Optimal sequential stochastic shortest path interdiction
- On supervalid inequalities for binary interdiction games
- Stochastic bilevel interdiction for fake news control in online social networks
- Integer linear programming formulations for the maximum flow blocker problem
- An exact method for trilevel hub location problem with interdiction
- A modified scenario bundling method for shortest path network interdiction under endogenous uncertainty
- The multi-terminal maximum-flow network-interdiction problem
- Data-driven interdiction with asymmetric cost uncertainty: a distributionally robust optimization approach
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Polynomial-time identification of robust network flows under uncertain arc failures
- Efficient algorithms for game-theoretic betweenness centrality
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
- Network flow interdiction on planar graphs
This page was built for publication: Stochastic network interdiction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781147)
