EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
4138. Resource-constrained network interdiction on nodes to mitigate threats
Invited abstract in session WC-29: Optimization issues on graphs I (Contributed), stream Combinatorial Optimization.
Wednesday, 12:30-14:00Room: 157 (building: 208)
Authors (first author is the speaker)
| 1. | Orhan Karasakal
|
| Industrial Engineering Department, Cankaya University | |
| 2. | Ahmet Kabarcık
|
| Industrial Engineering, Çankaya University |
Abstract
Network interdiction models have been utilized to analyze a wide variety of real-life problems such as military operations, illegal drug trafficking, increasing the preparedness of infrastructure against natural disasters or terrorist attacks, social networking, and preventing the spread of epidemics. This study explores a novel shortest-path interdiction problem variant with a single defense node against multiple adversarial nodes. The defense has limited resources to mitigate the threat posed by the adversary. By interdicting nodes and all connected arcs from those nodes, the defense aims to minimize the threat. The length of arcs connected to the interdicted node will increase inversely with the change in weight of the interdicted node. In this talk, the proposed mathematical model, the solution approach, and computational results will be presented.
Keywords
- Network Flows
- Combinatorial Optimization
- Mathematical Programming
Status: accepted
Back to the list of papers