EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

A Survey on Robust Maximum Flow Network Interdiction Problem

Bishnu Prasad Chapagai, Youb Raj Gaire

Pragnya Sarathi · 15.04.2026 · 24 (1) · 81-100

DOI: 10.3126/ps.v24i1.92763 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Pragnya Sarathi, online erschienen am 15.04.2026. Verfasst von Bishnu Prasad Chapagai und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Network interdiction has become a vital topic in operations research and optimization. It examines how networked systems can be intentionally disrupted or affected by unforeseen disturbances. This paper presents a comprehensive overview of robust maximum flow interdiction problems that seek to restrict the maximum amount of flow an adversary can route through a network under uncertainty in network parameters. Additionally, the paper discusses various modelling approaches and solution techniques applied to these problems, highlighting their computational challenges and outstanding possible directions for future research.

Zitieren

APA

Chapagai, B. P., & Gaire, Y. R. (2026). A Survey on Robust Maximum Flow Network Interdiction Problem. Pragnya Sarathi, 24(1), 81-100. https://doi.org/10.3126/ps.v24i1.92763

Vancouver

Chapagai BP, Gaire YR. A Survey on Robust Maximum Flow Network Interdiction Problem. Pragnya Sarathi. 2026;24(1):81-100. doi:10.3126/ps.v24i1.92763

BibTeX
@article{Chapagai2026,
  author = {Chapagai, Bishnu Prasad and Gaire, Youb Raj},
  title = {A Survey on Robust Maximum Flow Network Interdiction Problem},
  journal = {Pragnya Sarathi},
  year = {2026},
  volume = {24},
  number = {1},
  pages = {81--100},
  doi = {10.3126/ps.v24i1.92763}
}
Kostenlos starten →