Dynamic shortest‐path interdiction

DOI10.1002/net.21712zbMath1390.90124OpenAlexW2531090622MaRDI QIDQ4642404

J. Cole Smith, Jorge A. Sefair

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21712

zbMATH Keywords

dynamic programmingshortest pathboundsrobust optimizationNP-hardnessnetwork interdictionrelaxations

Mathematics Subject Classification ID

Noncooperative games (91A10) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Dynamic games (91A25)

Related Items (10)

A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Shortest path interdiction problem with convex piecewise-linear costs ⋮ Interdicting restructuring networks with applications in illicit trafficking ⋮ On the multistage shortest path problem under distributional uncertainty ⋮ Network interdiction with asymmetric cost uncertainty ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ A survey of network interdiction models and algorithms ⋮ The continuous maximum capacity path interdiction problem ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback

This page was built for publication: Dynamic shortest‐path interdiction