Shortest Path Network Interdiction With Goal Threshold

Shortest Path Network Interdiction With Goal Threshold

Network defense and attack problems can be modeled as network interdictions. In this paper, we consider a new version of the network interdiction problem that optimizes the interdictor's resource consumption while limiting network capacities (e.g., the shortest path) to a specified threshold. I...

Full description

Bibliographic Details
Main Authors: Xiangyu Wei, Cheng Zhu, Kaiming Xiao, Quanjun Yin, Yabing Zha
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Shortest path interdiction
Stackelberg game
goal threshold
Benders decomposition
Lagrange duality
Online Access:https://ieeexplore.ieee.org/document/8361422/

Internet

https://ieeexplore.ieee.org/document/8361422/

Similar Items