Shortest-path network interdiction
From MaRDI portal
Recommendations
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- Network interdiction with asymmetric cost uncertainty
- Dynamic shortest-path interdiction
- scientific article; zbMATH DE number 2050723
- Shortest path network interdiction with asymmetric information
Cited in
(only showing first 100 items - show all)- On the power of randomization in network interdiction
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Minimum cost edge blocker clique problem
- Scalable attack on graph data by injecting vicious nodes
- Shortest paths with shortest detours. A biobjective routing problem
- A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
- Using link analysis technique with a modified shortest-path algorithm to fight money laundering
- An exact approach for the \(r\)-interdiction covering problem with fortification
- Solving the traveling salesman problem with interdiction and fortification
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
- Survivable network design under optimal and heuristic interdiction scenarios
- Detecting critical node structures on graphs: a mathematical programming approach
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Minimizing a stochastic maximum-reliability path
- Optimizing system resilience: a facility protection model with recovery time
- Solving the bi-objective maximum-flow network-interdiction problem
- Nodal interdiction
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- Designing robust coverage networks to hedge against worst-case facility losses
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Heuristics for multi-stage interdiction of stochastic networks
- Shortest path network interdiction with asymmetric information
- A refined complexity analysis of finding the most vital edges for undirected shortest paths
- Wireless LAN transmitter location under the threat of jamming attacks
- The continuous maximum capacity path interdiction problem
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities
- A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Shortest path interdiction problem with arc improvement recourse: A multiobjective approach
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Algorithms and applications for a class of bilevel MILPs
- Sequential interdiction with incomplete information and learning
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- Cyclic games and linear programming
- Complexity of the multilevel critical node problem
- Vertex downgrading to minimize connectivity
- The multi-terminal maximum-flow network-interdiction problem
- Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm
- The stochastic critical node problem over trees
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- The r‐interdiction selective multi‐depot vehicle routing problem
- Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- Stackelberg production-protection games: defending crop production against intentional attacks
- The all-pairs vitality-maximization (VIMAX) problem
- An interdiction game on a queueing network with multiple intruders
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
- An exact method for binary fortification games
- Exact algorithms for the minimum cost vertex blocker clique problem
- Convex hull representation of the deterministic bipartite network interdiction problem
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
- Bulk-robust combinatorial optimization
- A survey on bilevel optimization under uncertainty
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
- Generalized bounded rationality and robust multicommodity network design
- Connectivity interdiction
- Equilibrium strategies for multiple interdictors on a common network
- The multiple shortest path problem with path deconfliction
- An effective bilevel programming approach for the evasive flow capturing location problem
- The stochastic interdiction median problem with disruption intensity levels
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
- Minimum edge blocker dominating set problem
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- An approach to the distributionally robust shortest path problem
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
- A survey of network interdiction models and algorithms
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- Logic-based Benders decomposition for wildfire suppression
- Radio communications interdiction problem under deterministic and probabilistic jamming
- Interdicting facilities in tree networks
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
- Selected topics in critical element detection
- Optimizing dynamic investment decisions for railway systems protection
- An extended network interdiction problem for optimal toll control
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach
- Matching interdiction
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Benders decomposition: solving binary master problems by enumeration
- Multilevel approaches for the critical node problem
- A unified framework for multistage mixed integer linear optimization
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- A bilevel mixed-integer program for critical infrastructure protection planning
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- A reinforcement learning approach to convoy scheduling on a contested transportation network
- Interdiction problems on planar graphs
- A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection
This page was built for publication: Shortest-path network interdiction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785225)
