Abstract The OR (Operations Research) in defense literature is reviewed. Various OR
methodologies are outlined, eg decision theory, game theory, mergers of differential …

The OR (Operations Research) in defense literature is reviewed. Various OR methodologies
are outlined, eg decision theory, game theory, mergers of differential equations and game …

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 introduce the parametric matroid one-interdiction problem. Given a matroid, each
element of its ground set is associated with a weight that depends linearly on a real …

In this paper, we consider a shortest path network interdiction problem with incomplete
information and multiple levels of interdiction intensity. The evader knows the attacker's …

Supervalid inequalities are a specific type of constraints often used within the branch-and-
cut framework to strengthen the linear relaxation of mixed-integer programs. These …

Given a vertex-weighted undirected graph with blocking costs of its vertices and edges, we
seek a minimum cost subset of vertices and edges to block such that the weight of any γ …

In the minimum spanning tree (MST) interdiction problem, we are given a graph $ G=(V, E) $
with edge weights, and want to find some $ X\subseteq E $ satisfying a knapsack constraint …

We consider mixed integer bilevel linear optimization problems in which the decision
variables of the lower-level (follower's) problem are all binary. We propose a general …

We consider a class of bilevel programming problems (BPPs) where the leader's decision
variables are all binary, the follower's decision variables are all continuous, and a fractional …