Mathematics Colloquia and Seminars

Return to Colloquia & Seminar listing

I will talk about a Stochastic Network Interdiction Problem, which is based on a paper by Cormican, Morton, and Wood. With limited resources, an interdictor tries to interdict or to destroy parts of capacitated network by using a two-stage stochastic integer problem: Minimize the expected maximum flow on a network when successes of interdictions are binary random variables. There are so many applications with this Stochastic Network Interdiction such as reducing military forces and to reducing illegal drugs. I'd like to show some formulations and examples of this problem.