Stochastic Maximum Flow Network Interdiction with Endogenous Uncertainty
We describe the two-stage maximum flow network interdiction problem under endogenous stochastic interdiction. Our model consists of two agents playing a Stackelberg game. A smuggler who wishes to maximize the expected flow of some illegal commodities that can be transmitted between a source and a si...
Main Authors: | Somayeh Sadeghi, Abbas Seifi |
---|---|
Format: | Article |
Language: | English |
Published: |
Kharazmi University
2019-08-01
|
Series: | International Journal of Supply and Operations Management |
Subjects: | |
Online Access: | http://www.ijsom.com/article_2790_531266d14d1468f89bec2883cc9f608b.pdf |
Similar Items
-
Maximum Flow Interdiction Problem in Multi-Period Dynamic Networks in Fuzzy Stochastic Hybrid Conditions
by: Salim Bavandi, et al.
Published: (2023-03-01) -
A Decomposition Approach for Stochastic Shortest-Path Network Interdiction with Goal Threshold
by: Xiangyu Wei, et al.
Published: (2019-02-01) -
Optimal Decision-Making Dealing with Enemy Sabotages Using the Maximum Flow Interdiction Problem in Multi-Period Dynamic Networks in Fuzzy Conditions
by: Hamid Bigdeli, et al.
Published: (2022-05-01) -
The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property
by: Kaiming Xiao, et al.
Published: (2020-01-01) -
Goal Recognition Control under Network Interdiction Using a Privacy Information Metric
by: Junren Luo, et al.
Published: (2019-08-01)