Pages that link to "Item:Q4785225"
From MaRDI portal
The following pages link to Shortest-path network interdiction (Q4785225):
Displaying 50 items.
- New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731) (← links)
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs (Q1999634) (← links)
- An effective bilevel programming approach for the evasive flow capturing location problem (Q2005787) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← links)
- The multiple shortest path problem with path deconfliction (Q2030451) (← links)
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- Scalable attack on graph data by injecting vicious nodes (Q2212510) (← links)
- Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388) (← links)
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks (Q2242189) (← links)
- Stackelberg production-protection games: defending crop production against intentional attacks (Q2242197) (← links)
- Network interdiction with asymmetric cost uncertainty (Q2242212) (← links)
- A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
- Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold (Q2311034) (← links)
- Optimal \(K\)-node disruption on a node-capacitated network (Q2311104) (← links)
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities (Q2337397) (← links)
- Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction (Q2357244) (← links)
- Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
- Survivable network design under optimal and heuristic interdiction scenarios (Q2460119) (← links)
- A bilevel mixed-integer program for critical infrastructure protection planning (Q2462537) (← links)
- Jamming communication networks under complete uncertainty (Q2465566) (← links)
- An exact solution approach for the interdiction median problem with fortification (Q2477666) (← links)
- Heuristics for multi-stage interdiction of stochastic networks (Q2491320) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection (Q2664335) (← links)
- An approach to the distributionally robust shortest path problem (Q2668652) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- Risk-averse shortest path interdiction (Q2830955) (← links)
- On a bi-level formulation to protect uncapacitated \(p\)-median systems with facility recovery time and frequent disruptions (Q2883619) (← links)
- Solving the bi-objective maximum-flow network-interdiction problem (Q2892322) (← links)
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers (Q2980027) (← links)
- Optimal and Game-Theoretic Deployment of Security Investments in Interdependent Assets (Q3179194) (← links)
- Minimizing a stochastic maximum-reliability path (Q3184595) (← links)
- Reformulation and sampling to solve a stochastic network interdiction problem (Q3184597) (← links)
- Shortest path network interdiction with asymmetric information (Q3184598) (← links)
- A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← links)
- Using link analysis technique with a modified shortest-path algorithm to fight money laundering (Q3446039) (← links)
