A problem in network interdiction
From MaRDI portal
Publication:4177291
DOI10.1002/nav.3800250412zbMath0394.90038OpenAlexW2012328405MaRDI QIDQ4177291
Publication date: 1978
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800250412
Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (41)
A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ 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 ⋮ A bilevel partial interdiction problem with capacitated facilities and demand outsourcing ⋮ Solving multi-period interdiction via generalized Bender's decomposition ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Matching interdiction ⋮ Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction ⋮ Interdicting the activities of a linear program -- a parametric analysis ⋮ Vertex downgrading to minimize connectivity ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ Shortest path interdiction problem with convex piecewise-linear costs ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Unnamed Item ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set ⋮ Attack and interception in networks ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ 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 ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ A bilevel programming model for proactive countermeasure selection in complex ICT systems ⋮ Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure ⋮ Network interdiction with asymmetric cost uncertainty ⋮ New solution approaches for the maximum-reliability stochastic network interdiction problem ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Deception tactics for network interdiction: A multiobjective approach ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ An exact solution approach for the interdiction median problem with fortification ⋮ Network interdiction to minimize the maximum probability of evasion with synergy between applied resources ⋮ Heuristics for multi-stage interdiction of stochastic networks ⋮ The multi-terminal maximum-flow network-interdiction problem ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Connectivity interdiction ⋮ A survey of network interdiction models and algorithms ⋮ Risk-Averse Shortest Path Interdiction ⋮ Finding the most vital arcs in a network ⋮ The continuous maximum capacity path interdiction problem ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
This page was built for publication: A problem in network interdiction
