TY  - JOUR
T1  - Multi-Commodity Multi-Source-Sinks Network Flow Interdiction Problem with Several Interdictors
AU - Keshavarzi, R. AU - Fathabadi, H. Salehi 
JO  - Journal of Engineering and Applied Sciences
VL  - 10
IS  - 6
SP  - 118
EP  - 122
PY  - 2015
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2015.118.122
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2015.118.122
KW  - bi-level programming
KW  -duality
KW  -simplex method
KW  -network flow
KW  -Interdiction problem
KW  -multi-commodity
KW  -decomposition
AB  - The present study seeks to investigate the multi-commodity multi-source-sink network flow interdiction problem with several interdictors. A network user and interdictors are considered as two main problematic elements in this study. While the network user aims to maximize total flow from several sources to several sinks, the interdictors try to reduce the network user’s maximum flow by blocking the arcs of the network. Arc blocking leads to some cost and there is limited resource for the required interdiction. To solve the problem, first, the user and interdictors problems were defined.
ER  -