Hardness and approximation for network flow interdiction
SR Chestnut, R Zenklusen - Networks, 2017 - Wiley Online Library
In the Network Flow Interdiction problem, an adversary attacks a network in order to
minimize the maximum s‐t‐flow. Very little is known about the approximatibility of this …
minimize the maximum s‐t‐flow. Very little is known about the approximatibility of this …
Maximum shortest path interdiction problem by upgrading edges on trees under weighted norm
Q Zhang, X Guan, PM Pardalos - Journal of Global Optimization, 2021 - Springer
Network interdiction problems by deleting critical edges have wide applicatio ns. However,
in some practical applications, the goal of deleting edges is difficult to achieve. We consider …
in some practical applications, the goal of deleting edges is difficult to achieve. We consider …
Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance
Q Zhang, X Guan, H Wang, PM Pardalos - Optimization Letters, 2021 - Springer
We consider the maximum shortest path interdiction problem by upgrading edges on trees
under Hamming distance (denoted by (MSPITH)), which has wide applications in …
under Hamming distance (denoted by (MSPITH)), which has wide applications in …
Interdicting structured combinatorial optimization problems with {0, 1}-objectives
SR Chestnut, R Zenklusen - Mathematics of Operations …, 2017 - pubsonline.informs.org
Interdiction problems ask about the worst-case impact of a limited change to an underlying
optimization problem. They are a natural way to measure the robustness of a system or to …
optimization problem. They are a natural way to measure the robustness of a system or to …
Blockers for the stability number and the chromatic number
Given an undirected graph G=(V, E) and two positive integers k and d, we are interested in
finding a set of edges (resp. non-edges) of size at most k to delete (resp. to add) in such a …
finding a set of edges (resp. non-edges) of size at most k to delete (resp. to add) in such a …
Critical edges for the assignment problem: Complexity and exact resolution
C Bazgan, S Toubaline, D Vanderpooten - Operations Research Letters, 2013 - Elsevier
This paper investigates two problems related to the determination of critical edges for the
minimum cost assignment problem. Given a complete bipartite balanced graph with n …
minimum cost assignment problem. Given a complete bipartite balanced graph with n …
Bound and exact methods for assessing link vulnerability in complex networks
Assessing network systems for failures is critical to mitigate the risk and develop proactive
responses. In this paper, we investigate devastating consequences of link failures in …
responses. In this paper, we investigate devastating consequences of link failures in …
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
Y Lei, H Shao, T Wu, P Liu - Optimization Letters, 2023 - Springer
Abstract Zhang et al.(Optim. Lett. 15 (21): 2661–2680, 2021) investigated the maximum
shortest path interdiction problem by upgrading edges on trees under unit Hamming …
shortest path interdiction problem by upgrading edges on trees under unit Hamming …
A large and natural Class of - and -complete Problems in Bilevel and Robust Optimization
C Grüne, L Wulf - arxiv preprint arxiv:2311.10540, 2023 - arxiv.org
Because $\Sigma^ p_2 $-and $\Sigma^ p_3 $-hardness proofs are usually tedious and
difficult, not so many complete problems for these classes are known. This is especially true …
difficult, not so many complete problems for these classes are known. This is especially true …
On the hardness of covering-interdiction problems
N Fröhlich, S Ruzika - Theoretical Computer Science, 2021 - Elsevier
We investigate a two player scenario, in which a decision maker locates some facilities in a
network, while a second player, called the interdictor, may disrupt the infrastructure by …
network, while a second player, called the interdictor, may disrupt the infrastructure by …