Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire

DOI10.31801/CFSUASMAS.425508MaRDI QIDQ5865822zbMATH OpenOpenAlexFDO

Authors Ertuğrul Ayyıldız, Gokhan Ozcelik, Cevriye Gencer

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

zbMATH Keywords

mathematical modelingnetwork interdictionshortest pathterrorist actions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Shortest-path network interdiction
• Optimization models of anti-terrorist protection
• scientific article; zbMATH DE number 2050723
• The k most vital arcs in the shortest path problem
• The multi-terminal maximum-flow network-interdiction problem

Cites work

• A Backward Sampling Framework for Interdiction Problems with Fortification
• A problem in network interdiction
• An extended network interdiction problem for optimal toll control
• Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
• Deterministic network interdiction
• Dynamic shortest-path interdiction
• Exact algorithms for solving a Euclidean maximum flow network interdiction problem
• Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
• Finding the n Most Vital Links in Flow Networks
• Finding the most vital arcs in a network
• scientific article; zbMATH DE number 2050722 (Why is no real title available?)
• Interdicting a Nuclear-Weapons Project
• Interdicting the activities of a linear program -- a parametric analysis
• Maximizing the minimum source-sink path subject to a budget constraint
• Most vital links and nodes in weighted networks
• Network flow interdiction on planar graphs
• Network interdiction via a critical disruption path: branch-and-price algorithms
• Nodal interdiction
• On short paths interdiction problems: Total and node-wise limited interdiction
• Optimal interdiction of a supply network
• Removing Arcs from a Network
• Risk-averse shortest path interdiction
• Sequential Shortest Path Interdiction with Incomplete Information
• Shortest path network interdiction with asymmetric information
• Shortest-path network interdiction
• Solving the bi-objective maximum-flow network-interdiction problem
• Stochastic network interdiction
• The fuzzy shortest path problem and its most vital arcs
• The k most vital arcs in the shortest path problem
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• The multi-terminal maximum-flow network-interdiction problem
• Two extended formulations for cardinality maximum flow network interdiction problem
• Two-Person Zero-Sum Games for Network Interdiction

Cited in

(5)

• Maximum shortest path interdiction problem by upgrading edges on trees under weighted l₁ norm
• 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
• Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
• The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees

This page was built for publication: Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865822)