Determine the complexity of single-commodity DCMCF
Determine the computational complexity of the Delay-Constrained Maximum Concurrent Flow (DCMCF) problem when restricted to a single commodity.
References
While this study improves the global understanding of the delay-constrained multi-commodity flow problem, several questions still remain open. For instance, the exact complexity of the problem with a single commodity remains unknown; further improvements to the problem's relaxations could be investigated in order to develop tractable optimization methods for larger instances.
— On the Delay-Constrained Maximum Concurrent Flow Problem
(2609.05068 - Ben-Ameur et al., 4 Sep 2026) in Conclusion