Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
From MaRDI portal
Publication:5865822
DOI10.31801/cfsuasmas.425508zbMath1487.90202OpenAlexW2803843567MaRDI QIDQ5865822
Cevriye Gencer, Gokhan Ozcelik, Ertuğrul Ayyıldız
Publication date: 10 June 2022
Published in: Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.31801/cfsuasmas.425508
Related Items
The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees, Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance, Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
Cites Work
- Unnamed Item
- An extended network interdiction problem for optimal toll control
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Nodal interdiction
- The multi-terminal maximum-flow network-interdiction problem
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
- The k most vital arcs in the shortest path problem
- Most vital links and nodes in weighted networks
- The fuzzy shortest path problem and its most vital arcs
- Interdicting the activities of a linear program -- a parametric analysis
- Deterministic network interdiction
- Finding the most vital arcs in a network
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
- Stochastic Network Interdiction
- Risk-Averse Shortest Path Interdiction
- Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
- Interdicting a Nuclear-Weapons Project
- Shortest path network interdiction with asymmetric information
- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
- Finding the n Most Vital Links in Flow Networks
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- Two extended formulations for cardinality maximum flow network interdiction problem
- Dynamic shortest‐path interdiction
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- Sequential Shortest Path Interdiction with Incomplete Information
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- Removing Arcs from a Network
- Optimal interdiction of a supply network
- A Backward Sampling Framework for Interdiction Problems with Fortification
