Bilevel optimization is a field of mathematical programming in which some variables are
constrained to be the solution of another optimization problem. As a consequence, bilevel …

This paper discusses the development of interdiction optimization models and algorithms,
with an emphasis on mathematical programming techniques and future research challenges …

This paper considers a Multiple Objective variant of the Critical Disruption Path problem to
extend its suitability in a range of security operations relying on path-based network …

In this paper, we introduce a new class of algorithms for solving the mixed-integer bilevel
min–max optimization problem. This problem involves two players, a leader and a follower …

Given a graph G and an interdiction budget k, the Maximum Clique Interdiction Problem
asks to find a subset of at most k vertices to remove from G so that the size of the maximum …

Given a graph G and an interdiction budget k∈ N, the Edge Interdiction Clique Problem
(EICP) asks to find a subset of at most k edges to remove from G so that the size of the …

We consider the problem of detecting a collection of critical node structures of a graph
whose deletion results in the maximum deterioration of the graph's connectivity. The …

This paper studies a general class of interdiction problems in which the solution space of
both the leader and follower are characterized by two discrete sets denoted the leader's …

We consider a two-player interdiction problem staged over a graph where the attacker's
objective is to minimize the cost of removing edges from the graph so that the defender's …

Many discrete optimization problems are amenable to constrained shortest-path
reformulations in an extended network space, a technique that has been key in …