R. Kevin Wood

Learn More
A stochastic program SP with solution value z∗ can be approximately solved by sampling n realizations of the program’s stochastic parameters, and by solving the resulting “approximating problem” for (x∗ n ; z ∗ n ). We show that, in expectation, z ∗ n is a lower bound on z∗ and that this bound monotonically improves as n increases. The rst result is used to(More)
We study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget. We formulate this bilevel, max–min problem as a mixed-integer program (MIP), which can be solved directly, but we(More)
We apply new bilevel and trilevel optimization models to make critical infrastructure more resilient against terrorist attacks. Each model features an intelligent attacker (terrorists) and a defender (us), information transparency, and sequential actions by attacker and defender. We illustrate with examples of the US Strategic Petroleum Reserve, the US(More)
The constrained shortest-path problem (CSPP) generalizes the standard shortest-path problem by adding one or more path-weight side constraints. We present a new algorithm for CSPP that Lagrangianizes those constraints, optimizes the resulting Lagrangian function, identifies a feasible solution, and then closes any optimality gap by enumerating nearshortest(More)
Using limited assets, an interdictor attempts to destroy parts of a capacitated network through which an adversary will subsequently maximize flow. We formulate and solve a stochastic version of the interdictor’s problem: Minimize the expected maximum flow through the network when interdiction successes are binary random variables. Extensions are made to(More)
Let G (V, E) be a graph whose edges may fail with known probabilities and let K _ V be specified. The K-terminal reliability of G, denoted R(GK), is the probability that all vertices in K are connected. Computing R(G:) is, in general, NP-hard. For some series-parallel graphs, R(Gn) can be computed in polynomial time by repeated application of well-known(More)
W describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow. The(More)
We describe JOINT DEFENDER, a new two-sided optimization model for planning the pre-positioning of defensive missile interceptors to counter an attack threat. In our basic model, a defender pre-positions ballistic missile defense platforms to minimize the worst-case damage an attacker can achieve; we assume that the attacker will be aware of defensive(More)
A “proliferator” seeks to complete a first small batch of fission weapons as quickly as possible, whereas an “interdictor” wishes to delay that completion for as long as possible. We develop and solve a max-min model that identifies resourcelimited interdiction actions that maximally delay completion time of the proliferator’s weapons project, given that(More)
Let G = (V,E) be an undirected graph whose edges may fail, and let G, denote G with a set K V specified. Edge failures are assumed to be statistically independent and to have known probabilities. The K-terminal reliability of G,, denoted R(G,), is the probability that all vertices in K are connected by working edges. Computing K-terminal reliability is an(More)