The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property

Critical network defense and attack problems, usually modeled as network interdiction, is of great significance. It is of great interest from the interdictor's view to study saturation property of resource allocations. This paper presents a bi-objective shortest path network interdiction model...

Full description

Bibliographic Details
Main Authors: Kaiming Xiao, Cheng Zhu, Weiming Zhang, Xiangyu Wei
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9152986/

Similar Items