Bhagwati Prasad Pande

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1