Skip to content
#

network-interdiction

Here are 2 public repositories matching this topic...

Risk-aware resupply routing for contested logistics: min-cost flow, Edmonds-Karp max-flow/min-cut, and budget-constrained network interdiction. This Operations-research toolkit for contested-logistics routing and interdiction. From-scratch min-cost flow, max-flow/min-cut, and NP-hard interdiction is companion code to a 4-day algorithms unit.

  • Updated Aug 17, 2026
  • Python

Add this topic to your repo

To associate your repository with the network-interdiction topic, visit your repo's landing page and select "manage topics."

Learn more