On the public citation graph
Minimizing a stochastic maximum‐reliability path
0 signed · 96 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800170302openalex-snapshot
Optimal interdiction of a supply network
inferredcites →https://doi.org/10.1002/nav.3800180103openalex-snapshot
Optimal interdiction policy for a flow network
inferredcites →https://doi.org/10.1002/nav.3800250412openalex-snapshot
A problem in network interdiction
inferredcites →https://doi.org/10.1007/0-306-48109-x_1openalex-snapshot
A Stochastic Program for Interdicting Smuggled Nuclear Material
inferredcites →https://doi.org/10.1007/0-306-48109-x_4openalex-snapshot
Interdicting Stochastic Networks with Binary Interdiction Effort
inferredcites →https://doi.org/10.1007/bf01581648openalex-snapshot
Two stage linear programming under uncertainty with 0–1 integer first stage variables
inferredcites →https://doi.org/10.1007/bf01584329openalex-snapshot
Maximizing the minimum source-sink path subject to a budget constraint
inferredcites →https://doi.org/10.1016/0167-6377(82)90020-7openalex-snapshot
Most vital links and nodes in weighted networks
inferredcites →https://doi.org/10.1016/0167-6377(89)90003-5openalex-snapshot
Finding the most vital arcs in a network
inferredcites →https://doi.org/10.1016/0167-6377(89)90065-5openalex-snapshot
The k most vital arcs in the shortest path problem
inferredcites →https://doi.org/10.1016/0377-2217(88)90159-2openalex-snapshot
A multicut algorithm for two-stage stochastic linear programs
inferredcites →https://doi.org/10.1016/0895-7177(93)90236-ropenalex-snapshot
Deterministic network interdiction
inferredcites →https://doi.org/10.1016/j.orl.2005.05.002openalex-snapshot
SPAR: stochastic programming with adversarial recourse
inferredcites →https://doi.org/10.1061/40745(146)16openalex-snapshot
Issues in Risk Management of Water Networks Against Intentional Attacks
inferredcites →https://doi.org/10.1080/07408170500488956openalex-snapshot
Models for nuclear smuggling interdiction
inferredcites →https://doi.org/10.1109/tpwrs.2004.825888openalex-snapshot
Analysis of Electric Grid Security Under Terrorist Threat
inferredcites →https://doi.org/10.1137/0117061openalex-snapshot
L -Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
inferredcites →https://doi.org/10.1287/inte.1060.0252openalex-snapshot
Defending Critical Infrastructure
inferredcites →https://doi.org/10.1287/opre.1050.0231openalex-snapshot
A Two-Sided Optimization for Theater Ballistic Missile Defense
inferredcites →https://doi.org/10.1287/opre.46.2.184openalex-snapshot
Stochastic Network Interdiction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4836602openalex-extracted
Novel Multi-Objective Bilevel Programming Model for the Ground Force Interdiction Deployment Problem
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0835openalex-snapshot
Stochastic Network Interdiction
inferred← citeshttps://doi.org/10.1002/nav.21567openalex-snapshot
Securing a border under asymmetric information
inferred← citeshttps://doi.org/10.1002/nav.21738openalex-snapshot
Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
inferred← citeshttps://doi.org/10.1002/nav.21859openalex-snapshot
Interdiction models for delaying adversarial attacks against critical information technology infrastructure
inferred← citeshttps://doi.org/10.1002/net.20458openalex-snapshot
Deception tactics for network interdiction: A multiobjective approach
inferred← citeshttps://doi.org/10.1002/net.21561openalex-snapshot
Exact algorithms for solving a Euclidean maximum flow network interdiction problem
inferred← citeshttps://doi.org/10.1002/net.21664openalex-snapshot
The wireless network jamming problem subject to protocol interference
inferred← citeshttps://doi.org/10.1002/net.21732openalex-snapshot
Two extended formulations for cardinality maximum flow network interdiction problem
inferred← citeshttps://doi.org/10.1002/net.21977openalex-snapshot
Network reliability: Heading out on the highway
inferred← citeshttps://doi.org/10.1002/net.21996openalex-snapshot
In search of network resilience: An optimization‐based view
inferred← citeshttps://doi.org/10.1002/net.22114openalex-snapshot
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
inferred← citeshttps://doi.org/10.1007/978-0-387-77247-9_24openalex-snapshot
Algorithms for Network Interdiction and Fortification Games
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_61openalex-snapshot
Modern Network Interdiction Problems and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-5278-2_4openalex-snapshot
Interdiction Models and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-31375-3_11openalex-snapshot
An Exact Method for Solving a Least-Cost Attack on Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_7openalex-snapshot
Implementing Automatic Benders Decomposition in a Modern MIP Solver
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_8openalex-snapshot
Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_25openalex-snapshot
Matrix Interdiction Problem
inferred← citeshttps://doi.org/10.1007/s10107-013-0650-3openalex-snapshot
Convex hull representation of the deterministic bipartite network interdiction problem
inferred← citeshttps://doi.org/10.1007/s10107-023-02019-2openalex-snapshot
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
inferred← citeshttps://doi.org/10.1007/s10287-018-0321-1openalex-snapshot
New solution approaches for the maximum-reliability stochastic network interdiction problem
inferred← citeshttps://doi.org/10.1007/s10479-009-0677-2openalex-snapshot
Network deployment of radiation detectors with physics-based detection probability calculations
inferred← citeshttps://doi.org/10.1007/s10479-023-05350-1openalex-snapshot
Shortest path network interdiction with incomplete information: a robust optimization approach
inferred← citeshttps://doi.org/10.1007/s10479-023-05812-6openalex-snapshot
Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
inferred← citeshttps://doi.org/10.1007/s10732-015-9306-1openalex-snapshot
Proximity Benders: a decomposition heuristic for stochastic programs
inferred← citeshttps://doi.org/10.1007/s11590-014-0829-4openalex-snapshot
Prioritized interdiction of nuclear smuggling via tabu search
inferred← citeshttps://doi.org/10.1016/j.asoc.2025.113933openalex-snapshot
Optimizing supply routes in a network interdiction model with dual defense operations
inferred← citeshttps://doi.org/10.1016/j.cie.2010.04.004openalex-snapshot
A bi-objective approach for shortest-path network interdiction
inferred← citeshttps://doi.org/10.1016/j.cie.2017.02.006openalex-snapshot
Trilevel shortest path network interdiction with partial fortification
inferred← citeshttps://doi.org/10.1016/j.cie.2017.02.022openalex-snapshot
Analyzing the robustness of an array of wireless access points to mobile jammers
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106480openalex-snapshot
Joint optimizing network interdiction and emergency facility location in terrorist attacks
inferred← citeshttps://doi.org/10.1016/j.cie.2024.109912openalex-snapshot
Attack graph-based stochastic modeling approach for enabling cybersecure semiconductor wafer fabrication
inferred← citeshttps://doi.org/10.1016/j.cor.2016.05.005openalex-snapshot
Interdicting attack graphs to protect organizations from cyber attacks: A bi-level defender–attacker model
inferred← citeshttps://doi.org/10.1016/j.cor.2019.01.014openalex-snapshot
Wireless LAN transmitter location under the threat of jamming attacks
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106965openalex-snapshot
Deep learning based high accuracy heuristic approach for knapsack interdiction problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.03.049openalex-snapshot
The reliable p -median problem with at-facility service
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.10.049openalex-snapshot
Overcoming human trafficking via operations research and analytics: Opportunities for methods, models, and applications
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.12.002openalex-snapshot
Risk-averse stochastic path detection
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.03.031openalex-snapshot
Multiple allocation hub interdiction and protection problems: Model formulations and solution approaches
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.06.024openalex-snapshot
A survey of network interdiction models and algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.11.011openalex-snapshot
Maximum probabilistic all-or-nothing paths
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.08.037openalex-snapshot
Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.05.028openalex-snapshot
The continuous maximum capacity path interdiction problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.01.008openalex-snapshot
A survey on bilevel optimization under uncertainty
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.07.013openalex-snapshot
An exact method for trilevel hub location problem with interdiction
inferred← citeshttps://doi.org/10.1016/j.ijcip.2021.100408openalex-snapshot
Risk-averse bi-level stochastic network interdiction model for cyber-security risk management
inferred← citeshttps://doi.org/10.1016/j.omega.2019.05.005openalex-snapshot
Dynamic interdiction networks with applications in illicit supply chains
inferred← citeshttps://doi.org/10.1016/j.omega.2019.102161openalex-snapshot
On greedy and strategic evaders in sequential interdiction settings with incomplete information
inferred← citeshttps://doi.org/10.1016/j.ress.2019.01.005openalex-snapshot
System survivability in the context of interdiction networks
inferred← citeshttps://doi.org/10.1016/j.ress.2023.109495openalex-snapshot
Minimizing the maximal reliable path with a nodal interdiction model considering resource sharing
inferred← citeshttps://doi.org/10.1016/j.swevo.2025.102265openalex-snapshot
Multi-objective bilevel programming model for optimizing network interdiction deployment
inferred← citeshttps://doi.org/10.1016/j.tre.2014.06.017openalex-snapshot
Vulnerability assessment and re-routing of freight trains under disruptions: A coal supply chain network application
inferred← citeshttps://doi.org/10.1016/j.trpro.2017.03.034openalex-snapshot
Vulnerability Analysis of Railway Networks in Case of Multi-Link Blockage
inferred← citeshttps://doi.org/10.1080/00207543.2021.2002962openalex-snapshot
Solving the shortest path interdiction problem via reinforcement learning
inferred← citeshttps://doi.org/10.1080/24725854.2019.1597316openalex-snapshot
Robust location of hidden interdictions on a shortest path network
inferred← citeshttps://doi.org/10.1080/24725854.2022.2045392openalex-snapshot
Homeland security research opportunities
inferred← citeshttps://doi.org/10.1108/s0276-8976(2010)0000014009openalex-snapshot
A multicriteria approach to critical facility security system design
inferred← citeshttps://doi.org/10.1109/3dv53792.2021.00126openalex-snapshot
Shortest Paths in Graphs with Matrix-Valued Edges: Concepts, Algorithm and Application to 3D Multi-Shape Analysis
inferred← citeshttps://doi.org/10.1109/hicss.2011.153openalex-snapshot
Detecting and Mitigating Abnormal Events in Large Scale Networks: Budget Constrained Placement on Smart Grids
inferred← citeshttps://doi.org/10.1109/ismsit52890.2021.9604681openalex-snapshot
A Stochastic Network-Interdiction Model For Cyber Security
inferred← citeshttps://doi.org/10.1109/ths.2016.7568892openalex-snapshot
Minimizing expected maximum risk from cyber-attacks with probabilistic attack success
inferred← citeshttps://doi.org/10.1111/tgis.12921openalex-snapshot
A family of models in support of realistic drug interdiction location decision‐making
inferred← citeshttps://doi.org/10.1243/1748006xjrr254openalex-snapshot
Multistate stochastic network interdiction via reliability modelling and evolutionary optimization
inferred← citeshttps://doi.org/10.1287/deca.2015.0325openalex-snapshot
Sequential Shortest Path Interdiction with Incomplete Information
inferred← citeshttps://doi.org/10.1287/ijoc.2016.0717openalex-snapshot
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
inferred← citeshttps://doi.org/10.1287/ijoc.2022.1185openalex-snapshot
On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
inferred← citeshttps://doi.org/10.1287/opre.2019.1892openalex-snapshot
The Benders Dual Decomposition Method
inferred← citeshttps://doi.org/10.1287/opre.2020.2023openalex-snapshot
The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1287/opre.2021.0503openalex-snapshot
Deepest Cuts for Benders Decomposition
inferred← citeshttps://doi.org/10.15760/etd.7315openalex-snapshot
Robust Maximum Flow Network Interdiction Problem
inferred← citeshttps://doi.org/10.3390/sym11020237openalex-snapshot
A Decomposition Approach for Stochastic Shortest-Path Network Interdiction with Goal Threshold
inferred← citeshttps://doi.org/10.61112/jiens.1389871openalex-snapshot
Optimal defense strategies against intelligent cyber attacks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.