Derives necessary and sufficient conditions for submodularity and supermodularity in min-cost flow, max-flow, shortest-path, and facility location interdiction problems under general topologies.
Bilevel mixed-integer linear program with binary tender.arXiv:2509.02370, 2025
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Supermodularity and Submodularity in Network Interdiction
Derives necessary and sufficient conditions for submodularity and supermodularity in min-cost flow, max-flow, shortest-path, and facility location interdiction problems under general topologies.