Robust static and dynamic maximum flows

DOI10.1007/S10878-025-01298-ZMaRDI QIDQ6956327zbMATH OpenFDO

Authors Christian Biefel, Martina Kuchlbauer, F. Liers, Lisa Waldmüller

Publication date 18 July 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

network flowsrobust optimizationflows over timerobust maximum flows

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Flows in graphs (05C21) Robustness in mathematical programming (90C17)

Cites work

• scientific article; zbMATH DE number 961880 (Why is no real title available?)
• A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow
• An introduction to network flows over time
• Constructing maximal dynamic flows from static flows
• Deterministic network interdiction
• Efficient continuous-time dynamic network flow algorithms
• Flows in dynamic networks with aggregate arc capacities
• Hardness and approximation for network flow interdiction
• Maximal Flow Through a Network
• Maximizing residual flow under an arc destruction
• Network flows. Theory, algorithms, and applications.
• On the power of randomization in network interdiction
• Removing Arcs from a Network
• Robust and adaptive network flows
• Robust discrete optimization and network flows
• Robust flows over time: models and complexity results
• Single-commodity robust network design with finite and hose demand sets
• The Price of Robustness
• The complexity of computing a robust flow
• The maximum residual flow problem: NP‐hardness with two‐arc destruction
• The robust network loading problem with dynamic routing

This page was built for publication: Robust static and dynamic maximum flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956327)