Pages that link to "Item:Q3184595"
From MaRDI portal
The following pages link to Minimizing a stochastic maximum-reliability path (Q3184595):
Displayed 23 items.
- The reliable \(p\)-median problem with at-facility service (Q319654) (← links)
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model (Q342516) (← links)
- Network deployment of radiation detectors with physics-based detection probability calculations (Q646698) (← links)
- Prioritized interdiction of nuclear smuggling via tabu search (Q895756) (← links)
- Wireless LAN transmitter location under the threat of jamming attacks (Q1734815) (← links)
- Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications (Q1751884) (← links)
- Risk-averse stochastic path detection (Q1753422) (← links)
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
- New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- Maximum probabilistic all-or-nothing paths (Q2286936) (← 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)
- Deception tactics for network interdiction: A multiobjective approach (Q4648690) (← links)
- Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms (Q4994144) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs (Q5106425) (← links)
- The Benders Dual Decomposition Method (Q5130513) (← links)
- A survey on bilevel optimization under uncertainty (Q6096565) (← links)