@article{MAKHILLJEAS201510613504,
    title = {Multi-Commodity Multi-Source-Sinks Network Flow Interdiction Problem with Several Interdictors},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {10},
    number = {6},
    pages = {118-122},
    year = {2015},
    issn = {1816-949x},
    doi = {jeasci.2015.118.122},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2015.118.122},
    author = {R. and},
    keywords = {bi-level programming,duality,simplex method,network flow,Interdiction problem,multi-commodity,decomposition},
    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.}
    }