Shortest-path network interdiction
From MaRDI portal
Publication:4785225
DOI10.1002/net.10039zbMath1027.90106OpenAlexW2093517413MaRDI QIDQ4785225
Publication date: 17 December 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10039
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items (only showing first 100 items - show all)
Complexity of the multilevel critical node problem ⋮ Interdicting facilities in tree networks ⋮ On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions ⋮ Minimum cost edge blocker clique problem ⋮ Exact algorithms for the minimum cost vertex blocker clique problem ⋮ Optimal and Game-Theoretic Deployment of Security Investments in Interdependent Assets ⋮ Minimum edge blocker dominating set problem ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ An extended network interdiction problem for optimal toll control ⋮ Minimizing a stochastic maximum-reliability path ⋮ Reformulation and sampling to solve a stochastic network interdiction problem ⋮ Shortest path network interdiction with asymmetric information ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Solving multi-period interdiction via generalized Bender's decomposition ⋮ Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning ⋮ Matching interdiction ⋮ A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ An approach to the distributionally robust shortest path problem ⋮ Integer programming formulations for three sequential discrete competitive location problems with foresight ⋮ Integer programming methods for solving binary interdiction games ⋮ A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths ⋮ Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges ⋮ Designing robust coverage networks to hedge against worst-case facility losses ⋮ Exact solution approaches for a class of bilevel fractional programs ⋮ A branch-and-cut algorithm for the generalized traveling salesman problem with time windows ⋮ A reinforcement learning approach to convoy scheduling on a contested transportation network ⋮ Nodal interdiction ⋮ Interdiction problems on planar graphs ⋮ Approximation algorithms for \(k\)-hurdle problems ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph ⋮ A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem ⋮ Optimizing system resilience: a facility protection model with recovery time ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ Scalable attack on graph data by injecting vicious nodes ⋮ Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers ⋮ An exact approach for the \(r\)-interdiction covering problem with fortification ⋮ On short paths interdiction problems: Total and node-wise limited interdiction ⋮ 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 ⋮ Solving the traveling salesman problem with interdiction and fortification ⋮ Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ Wireless LAN transmitter location under the threat of jamming attacks ⋮ Survivable network design under optimal and heuristic interdiction scenarios ⋮ Radio communications interdiction problem under deterministic and probabilistic jamming ⋮ A bilevel mixed-integer program for critical infrastructure protection planning ⋮ Cyclic games and linear programming ⋮ A bilevel programming model for proactive countermeasure selection in complex ICT systems ⋮ Jamming communication networks under complete uncertainty ⋮ A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows ⋮ Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure ⋮ 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 ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Optimal sensor deployment to increase the security of the maximal breach path in border surveillance ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ An analytical approach to the protection planning of a rail intermodal terminal network ⋮ A nested family of \(k\)-total effective rewards for positional games ⋮ 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 ⋮ An exact solution approach for the interdiction median problem with fortification ⋮ Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs ⋮ Network interdiction to minimize the maximum probability of evasion with synergy between applied resources ⋮ An effective bilevel programming approach for the evasive flow capturing location problem ⋮ Heuristics for multi-stage interdiction of stochastic networks ⋮ The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability ⋮ The multi-terminal maximum-flow network-interdiction problem ⋮ Connectivity interdiction ⋮ Benders decomposition: solving binary master problems by enumeration ⋮ On the power of randomization in network interdiction ⋮ Equilibrium strategies for multiple interdictors on a common network ⋮ The multiple shortest path problem with path deconfliction ⋮ Algorithms and applications for a class of bilevel MILPs ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ Perfect matching interdiction problem restricted to a stable vertex ⋮ Bulk-robust combinatorial optimization ⋮ A survey of network interdiction models and algorithms ⋮ Generalized Bounded Rationality and Robust Multicommodity Network Design ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold ⋮ Optimal \(K\)-node disruption on a node-capacitated network ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ Risk-Averse Shortest Path Interdiction ⋮ Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs ⋮ The continuous maximum capacity path interdiction problem ⋮ 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
Uses Software
Cites Work
This page was built for publication: Shortest-path network interdiction
