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.

Background

The paper establishes that DCMCF is strongly NP-hard even with at most three commodities sharing a common source and destination, and even when every source-to-destination path is potentially available to every commodity. The authors explicitly identify the single-commodity case as an unresolved boundary of the complexity landscape.

Resolving this question would clarify whether the strong NP-hardness result persists with only one commodity or whether the single-commodity problem admits a polynomial-time algorithm or a weaker complexity classification.

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