Robust static and dynamic maximum flows

Christian Biefel (), Martina Kuchlbauer (), Frauke Liers () and Lisa Waldmüller ()
Additional contact information
Christian Biefel: Friedrich-Alexander-Universität Erlangen-Nürnberg
Martina Kuchlbauer: Friedrich-Alexander-Universität Erlangen-Nürnberg
Frauke Liers: Friedrich-Alexander-Universität Erlangen-Nürnberg
Lisa Waldmüller: Friedrich-Alexander-Universität Erlangen-Nürnberg

Journal of Combinatorial Optimization, 2025, vol. 49, issue 5, No 10, 42 pages

Abstract: Abstract We study the robust maximum flow problem and the robust maximum flow over time problem where a given number of arcs $$\Gamma $$ Γ may fail or may be delayed. Two prominent models have been introduced for these problems: either one assigns flow to arcs fulfilling weak flow conservation in any scenario, or one assigns flow to paths where an arc failure or delay affects a whole path. We provide a unifying framework by presenting novel general models, in which we assign flow to subpaths. These models contain the known models as special cases and unify their advantages in order to obtain less conservative robust solutions. We give a thorough analysis with respect to complexity of the general models. In particular, we show that the general models are essentially NP-hard, whereas, e.g., in the static case with $$\Gamma =1$$ Γ = 1 an optimal solution can be computed in polynomial time. Further, we answer the open question about the complexity of the dynamic path model for $$\Gamma =1$$ Γ = 1 . We also compare the solution quality of the different models. In detail, we show that the general models have better robust optimal values than the known models and we prove bounds on these gaps.

Keywords: Robust maximum flows; Network flows; Flows over time; Robust optimization; 05C21; 90C05; 90C17; 90C27; 90C35 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01298-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01298-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01298-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().