Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
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.
How to cite this article:
H. Salehi Fathabadi and R. Keshavarzi. Multi-Commodity Multi-Source-Sinks Network Flow Interdiction Problem with Several Interdictors.
DOI: https://doi.org/10.36478/jeasci.2015.118.122
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2015.118.122