You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Aug 28, 2025. It is now read-only.
As mentioned in issue #400, LightGraphs.jl, I would like to add some algorithms to compute Network Interdiction flows.
As a mid-term objective it would be:
A polynomial algorithm (exact for a category of network, approximation otherwise) based on the Extended Multiroute Flow available (very soon) in LightGraphs.jl
For Network Interdiction and Adaptive Flow (arc version)
2-approximation for Adaptive Flow (path version)
A Bilevel Mixed-Integer Linear Program (BMILP) using JuMP when the previous algorithm fails to give the exact value
For Adaptive Flow (arc version)
For Adaptive Flow (path version)
For Network Interdiction (available in the literature)
There are a couple of other algorithms available also in the academic literature, but I don't plan to add them before a while.