Preprint
Nov 2026
Generalized Flows over Time: Complexity, Structure and Algorithm
It is proved that the generalized maximum flow over time problem remains NP-hard under standard binary encoding, even on lossy two-terminal series-parallel networks, and it is proved that an optimal solution always exists without intermediate storage.
Si-Yuan Chen, Shengminjie Chen, Sui-Xiang Gao et al.
· 0 citations