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)- Exact algorithms for the minimum cost vertex blocker clique problem
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- Shortest paths with shortest detours. A biobjective routing problem
- Integer programming formulations for three sequential discrete competitive location problems with foresight
- An exact approach for the \(r\)-interdiction covering problem with fortification
- Solving the traveling salesman problem with interdiction and fortification
- Wireless LAN transmitter location under the threat of jamming attacks
- Radio communications interdiction problem under deterministic and probabilistic jamming
- A bilevel programming model for proactive countermeasure selection in complex ICT systems
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
- An analytical approach to the protection planning of a rail intermodal terminal network
- An interdiction game on a queueing network with multiple intruders
- A dynamic reformulation heuristic for generalized interdiction problems
- On a class of bilevel linear mixed-integer programs in adversarial settings
- 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
- Connectivity interdiction
- Benders decomposition: solving binary master problems by enumeration
- On the power of randomization in network interdiction
- Perfect matching interdiction problem restricted to a stable vertex
- The stochastic interdiction median problem with disruption intensity levels
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- An effective bilevel programming approach for the evasive flow capturing location problem
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted l₁ norm
- Equilibrium strategies for multiple interdictors on a common network
- The multiple shortest path problem with path deconfliction
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
- The continuous maximum capacity path interdiction problem
- Complexity of the multilevel critical node problem
- Interdicting facilities in tree networks
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Scalable attack on graph data by injecting vicious nodes
- Most vital vertices for the shortest s-t path problem: complexity and branch-and-cut algorithm
- 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
- Network interdiction with asymmetric cost uncertainty
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Convex hull representation of the deterministic bipartite network interdiction problem
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Algorithms and applications for a class of bilevel MILPs
- A survey of network interdiction models and algorithms
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- Optimal K-node disruption on a node-capacitated network
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities
- Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
- Solving multi-period interdiction via generalized Bender's decomposition
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
- 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
- An exact solution approach for the interdiction median problem with fortification
- Heuristics for multi-stage interdiction of stochastic networks
- Bulk-robust combinatorial optimization
- A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection
- An approach to the distributionally robust shortest path problem
- Integer programming methods for solving binary interdiction games
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
- Exact solution approaches for a class of bilevel fractional programs
- Risk-averse shortest path interdiction
- On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions
- Solving the bi-objective maximum-flow network-interdiction problem
- A refined complexity analysis of finding the most vital edges for undirected shortest paths
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
- Optimal and game-theoretic deployment of security investments in interdependent assets
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- Minimum edge blocker dominating set problem
- 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
- A brief overview of interdiction and robust optimization
- A class of algorithms for mixed-integer bilevel min-max optimization
- Network interdiction via a critical disruption path: branch-and-price algorithms
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Protection issues for supply systems involving random attacks
- The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
- Using link analysis technique with a modified shortest-path algorithm to fight money laundering
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Nodal interdiction
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- Optimizing system resilience: a facility protection model with recovery time
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Detecting critical node structures on graphs: a mathematical programming approach
- Dynamic shortest-path interdiction
- Sequential Shortest Path Interdiction with Incomplete Information
- Generalized bounded rationality and robust multicommodity network design
- Sequential interdiction with incomplete information and learning
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- Multilevel approaches for the critical node problem
- On the independent set interdiction problem
- A unified framework for multistage mixed integer linear optimization
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)
