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.
python docker cli algorithms graph-algorithms optimization routing network-flow np-hard logistics operations-research max-flow min-cut min-cost-flow fastapi dijsktra edmonds-karp network-interdiction
-
Updated
Aug 17, 2026 - Python