Abstract
We describe a stochastic network interdiction model for locating sensors that detect nuclear material. A nuclear material smuggler selects a path through a transportation network that maximizes the probability of avoiding detection. An interdictor installs sensors to minimize that maximum probability. We formulate this problem as a bi-level stochastic mixed-integer program, and then focus on a special case in which the underlying network is bipartite. We show that a class of valid inequalities, called step inequalities, can significantly reduce computational effort.
Original language | English (US) |
---|---|
Title of host publication | IIE Annual Conference and Exposition 2005 |
State | Published - Dec 1 2005 |
Event | IIE Annual Conference and Exposition 2005 - Atlanta, GA, United States Duration: May 14 2005 → May 18 2005 |
Other
Other | IIE Annual Conference and Exposition 2005 |
---|---|
Country/Territory | United States |
City | Atlanta, GA |
Period | 5/14/05 → 5/18/05 |
Keywords
- Mixed-integer programming
- Network interdiction
- Nonproliferation
- Stochastic programming
ASJC Scopus subject areas
- General Engineering