Maximum Robust Flow: Optimization & Algorithms

• Maximum Robust Flow (MRF) is a robust optimization model that computes a path-flow maximizing the guaranteed surviving flow under any k-arc deletion.
• The computational complexity shifts from polynomial-time solvable for k=1 to NP-hard and even Σ2P-hard for k ≥ 2, highlighting significant algorithmic challenges.
• Advanced techniques like primal–dual iterative separation and column-and-cut generation offer effective approximations and practical scalability in large networks.

Maximum Robust Flow (MRF) is the central robust optimization model for characterizing flows in capacitated networks subject to arc failures. In the classical setting, an $s$–$t$ flow is assigned to paths in a directed graph $G=(V,E)$, and an adversary may remove up to $k$ arcs, destroying all flow traversing any removed arc. The MRF problem is to compute a path-flow maximizing the guaranteed surviving flow under any such adversarial $k$-arc deletion. This problem lies at the intersection of combinatorial optimization, network interdiction, and robust optimization, and has attracted significant research interest due to its algorithmic challenges, application to critical infrastructure resilience, and connections to robust and adaptive flows, interdiction games, and rerouting models.

1. Formal Definition and Canonical LP Formulation

Given a directed network $G=(V,E)$ with source $s\in V$, sink $t\in V$, and nonnegative arc capacities $u_e$ ($e\in E$), let $\mathcal{P}$ denote the set of all simple $s$–$t$ paths. For integer $k\ge1$, the set of $k$-failure scenarios is $\Omega = \{ \eta \subseteq E : |\eta|=k \}$. Let decision variables $x_P\ge0$ be the flow assigned to path $P\in\mathcal{P}$, and $\lambda\in\mathbb{R}$ represent the worst-case flow loss. The path-based MRF problem is

$$\max_{x\geq0,\,\sum_{P\ni e}x_P \leq u_e} \Big\{ \sum_{P\in\mathcal{P}} x_P - \lambda : \lambda \geq \sum_{P: P\cap\eta\neq\emptyset} x_P\ \forall\,\eta\in\Omega \Big\},$$

where $\lambda^*$ in the optimal solution is the worst-case total flow destroyed by any $k$-arc failure.

This formulation can be cast as a compact bilinear LP if and only if both $|\mathcal{P}|$ and $|\Omega|$ are “small,” but in general both these sets are exponentially large in $|V|$ and $|E|$.

In the general robust optimization context, the problem seeks

$$\max_{x\in\mathcal{F}}\,\min_{\eta\in\Omega}\, \sum_{P: P\cap \eta = \emptyset} x_P,$$

where $\mathcal{F}$ is the path-flow polytope under arc capacities.

2. Complexity Landscape and Approximation

The combinatorial and computational complexity of MRF displays a sharp dichotomy with respect to the parameter $k$ (number of arc failures):

Setting	Complexity Status	Reference
$k=1$	Polynomial-time (efficient parametric LP)	(Disser et al., 2017), Aneja–Nair (2001)
fixed $k\geq 2$	NP-hard for any constant $k>1$	(Matuschke, 9 Nov 2025)
$k$ part of input	Strongly NP-hard; $P^{NP[\log]}$-hard	(Matuschke, 9 Nov 2025, Disser et al., 2017)
Integral MRF, $k=2$	$\Sigma_2^P$-hard (integral version)	(Matuschke, 9 Nov 2025)

The transition from tractability at $k=1$ to NP-hardness for $k\geq 2$ is notable: for $k=1$, the problem reduces to trading between total flow and the maximal load on any single arc, solvable using a parametric sweep over arc capacities and $O(|E|)$ max-flow calls. For $k\geq2$, (Matuschke, 9 Nov 2025) establishes that even for constant $k$ the adversarial $k$-arc deletion makes the problem NP-complete (fractional) and $\Sigma_2^P$-hard (integral). When $k$ is input, MRF becomes $P^{NP[\log]}$-hard via a reduction from the Boolean hierarchy.

Polynomial-time solvability remains only for special cases: e.g., in unit-capacity networks or for edge-based (as opposed to path-based) robust flow models (Biefel et al., 2022).

Approximation algorithms have been developed. The best known guarantee is $O(k)$, specifically a $(k+1)/(k^2/4 + k + 1)$-approximation (Mies et al., 2017), and a $(k+1)$-approximation via $k$-route flows [Baffier-Robins-Zeghal]. There is currently no hardness of approximation lower bound beyond NP-hardness.

3. Algorithmic Approaches: Primal–Dual Iterative Separation

Direct application of LP or MIP solvers is infeasible due to exponential numbers of variables and constraints. (Mies et al., 2017) develops an effective column-and-cut generation (“simultaneous primal–dual separation”) scheme:

• Restricted master problem: Start with small pools $\mathcal{P}' \subset \mathcal{P}$ (paths), $\Omega' \subset \Omega$ (scenarios). Solve the LP restricted to these sets.
• Column generation: Use dual multipliers to price (find) new path-columns with positive reduced cost. The pricing subproblem reduces to maximizing reduced cost over all $s$–$t$ paths, with rewards and penalties according to dual variables; this is an (NP-hard) combinatorial optimization, but efficiently solvable heuristics suffice in practice for moderate $k$.
• Cut generation: Given a candidate flow, solve the network interdiction problem (inner minimization) to find a worst-case $k$-arc failure scenario; this separation problem is also NP-hard, but can be managed via heuristic or enumerative approaches for small $k$.

The cycle continues, alternately adding violating scenarios (primal cuts) and beneficial new paths (dual columns), until primal and dual bounds coincide. In practice, only a small number of iterations (typically $3$–$8$) and a modest number of scenarios ($\leq 9000$) are needed to obtain optimal or near-optimal flows for networks of thousands of arcs.

Initialization and heuristics: The initial path pool can be seeded using the Bertsimas–Sim relaxed flow—a nominal flow penalized by $k \cdot$ (maximum arc load)—which is near-optimal in most tested instances.

Empirical performance: The approach handles large random and structured networks, demonstrates stable convergence with robust lower/upper bounds, and supports further customization to limit scenario generation per iteration or diversify the search (minor penalties for scenario reuse).

4. Hybrid Robust–Stochastic MRF and Generalization Error Bounds

(Mies et al., 2017) proposes an extension interpolating between classical robust and stochastic models:

• Failure (or attack) scenarios are grouped into classes $\Omega_1,\dots,\Omega_K$ with assigned probabilities $q_k$.
• The objective is $$\max_{x\in\mathcal{F}} \sum_{k=1}^K q_k \min_{\eta\in\Omega_k} \mathrm{Val}_\eta(x)$$, where $\mathrm{Val}_\eta(x)$ denotes the surviving flow under scenario $\eta$.
  • If $K=1$ and $\Omega_1$ is the set of all $k$-failures, this recovers the standard MRF.
  • If $K=|\Omega|$ and each $q_k$ is the empirical probability of scenario $\eta_k$, the model is fully stochastic.

The same primal–dual separation mechanics apply classwise, with $\lambda_k$ variables tracking classwise worst-case loss.

A generalization-error bound is established: Letting $N$ be the sample size of historical failure data and $\hat{q}_k$ the empirical class frequencies, the bound on the hybrid robust value is of Rademacher-type,

$$\sum_k q_k \min_{\eta\in\Omega_k} \mathrm{Val}_\eta(x) \geq \sum_k \hat{q}_k \min_{\eta\in\Omega_k} \mathrm{Val}_\eta(x) - \mathrm{err}(N,\{\lambda_k^*, C\},\delta),$$

where $\mathrm{err}(\cdot)$ is explicit and diminishes with increasing $N$ and class sizes.

A min–max theorem guarantees that, under convexity and concavity conditions, the hybrid model optimizes the worst-case expected value over distributions consistent with class weights.

5. Extensions to General Robust Linear Optimization

The primal–dual separation technique and the hybrid robust–stochastic framework generalize to settings with any convex feasible region $X \subset \mathbb{R}^n$ and concave scenario payoffs $\mathrm{Val}_\omega(x)$. The only essential requirement is the convexity of $X$ and concavity of each scenario utility in $x$. Both the min–max equivalence and the generalization-error bounds carry over, making this approach broadly applicable beyond robust flows (Mies et al., 2017).

6. Empirical Findings and Practical Recommendations

Computational studies on various network families (series, NETGEN, R-MAT) with $k=5,15$ demonstrate that typically $3$–$8$ primal–dual separation iterations suffice. The number of generated paths per run is usually less than $150$; the number of scenario cuts reaches up to $9000$ in the largest instances. The path-pricing mixed integer programs (MIPs) require under 10 seconds, with primal-cut MIPs (interdiction) almost always below 1 second per iteration.

A summary of practical insights:

Recommendation	Justification from Computational Study
Initialize path pool with Bertsimas–Sim H	Empirically optimal or near-optimal in most tested networks
Generate up to $c$ scenarios per round	Balances number of scenarios vs. pricing solution time
Apply minor penalties for cut/column reuse	Increases diversity and convergence stability
Solver scalability	Thousands of arcs and hundreds of scenarios in minutes

Where the Bertsimas–Sim heuristic is not optimal, the optimality gap is modest ($5$–$25$\%).

7. Connections, Generalizations, and Open Problems

MRF is an anchor problem within broader robust network optimization. Key variations include:

• Edge-based MRF: Instead of path-based flows, assign flow on arcs under weak conservation in every scenario, making the problem polynomial-time solvable for all $k$ (Biefel et al., 2022).
• General subpath-based models: Unify path and edge models, strictly extend optimal robust value, but are NP-hard except for $k=1$ (Biefel et al., 2022).
• Reroutable flows: Allow interrupted flow to be “rerouted” after arc failures—leading to a distinct set of tractability and approximation characteristics, including min-cut duals bounding the flow–cut gap by a factor of $2$ (Matuschke et al., 2017).
• Dynamic robust flows: Over time, with uncertain travel times and delays, robust flow problems are typically NP-hard; temporally repeated flows can exhibit unbounded suboptimality compared to optimal dynamic policies (Gottschalk et al., 2016).

Recent hardness results resolve long-standing open questions: MRF is NP-hard even for $k=2$ (Matuschke, 9 Nov 2025), answering the complexity status for small fixed $k$ that had previously been open due to gaps in prior hardness reductions (Disser et al., 2017).

Open problems include: obtaining constant-factor approximation algorithms for general $k$; characterizing the support size of optimal robust flows; and designing practical heuristics and algorithms for MRF variants in operational settings, especially for large-scale, dynamic, or hybrid uncertainty regimes.

---

MRF constitutes a central case of robust network optimization under discrete scenario uncertainty, is now known to be tractable only for special cases (small or highly structured $k$), and remains an active area for algorithmic and modeling advances in both theory and application.