Reduction of Maximum Flow Network Interdiction Problem: Step towards the Polynomial Time Solutions
نویسندگان
چکیده
منابع مشابه
Reduction of Maximum Flow Network Interdiction Problem: Step towards the Polynomial Time Solutions
In the present work an attempt is being made to reduce the Maximum Flow Network Interdiction Problem (MFNIP) in to the Subset Sum Problem so as to get some algorithms solvable in polynomial time. Previously developed algorithms are either applicable to some special cases of MFNIP or they do not have a constant performance guarantee. Our reduction has paved the way towards the development of ful...
متن کاملCardinality Maximum Flow Network Interdiction Problem Vs. The Clique Problem
Cardinality Maximum Flow Network Interdiction Problem (CMFNIP) is known to be strongly NP-hard problem in the literature. A particular case of CMFNIP has been shown to have reduction from clique problem. In the present work,an effort is being made to solve this particular case of CMFNIP in polynomial time. Direct implication of this solution is that the clique problem gets solved in polynomial ...
متن کاملReduction of Maximum Flow Network Interdiction Problem from The Clique Problem
Maximum Flow Network Interdiction Problem (MFNIP) is known to be strongly NP-hard problem. We solve a simple form of MFNIP in polynomial time. We review the reduction of MFNIP from the clique problem. We propose a polynomial time solution to the Clique Problem.
متن کاملThe multi-terminal maximum-flow network-interdiction problem
This paper defines and studies the multi-terminal maximum-flow network-interdiction problem (MTNIP) in which a network user attempts to maximize flow in a network among K P 3 pre-specified node groups while an interdictor uses limited resources to interdict network arcs to minimize this maximum flow. The paper proposes an exact (MTNIP-E) and an approximating model (MPNIM) to solve this NP-hard ...
متن کاملSolving the Bi-Objective Maximum-Flow Network-Interdiction Problem
W describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow. The algorithm identifies these solutions throu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2013
ISSN: 2249-0868
DOI: 10.5120/ijais12-450870