Approximation algorithm for maximum flow network interdiction problem
We consider the maximum flow network interdiction problem. We provide a new interpretation of the problem and define a concept called ”optimalcut”. We propose a heuristic algorithm to obtain an approximated cut, and we also obtain its error bound. Finally, we show that our heuristic is an α-approxim...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ferdowsi University of Mashhad
2020-04-01
|
| Series: | Iranian Journal of Numerical Analysis and Optimization |
| Subjects: | |
| Online Access: | https://ijnao.um.ac.ir/article_25057_3e816cb4757e6d44b348882fe82a326b.pdf |