Jul 24, 2007 · The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, ...
In this model, an arc failure has the effect that the flow on all paths that contain the failing arc is deleted. ... ... We call this formulation path model (PM) ...
The problem is to identify the arcs to be reversed in order to achieve a maximum flow from source (s) to sink (s). The problem finds its applications in ...
In this paper, we consider two problems related to single-commodity flows on a directed network. In the first problem, for a given s - t flow, if an arc is ...
The maximum residual flow problem: NP‐hardness with two‐arc destruction · D. DuR. Chandrasekaran. Computer Science, Mathematics. Networks. 2007. TLDR. The ...
Mar 9, 2020 · When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with k-Arc Destruction is known to be NP-hard for k = 2. We show ...
Abstract. In this paper we consider two problems related to single commodity flows on a directed network. In the first problem, for a given s t flow, ...
Missing: NP- hardness
When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with $k$-Arc Destruction is known to be $NP$-hard for $k=2$.
Du et al. The maximum residual flow problem: NP-hardness with two-arc destruction. Networks. (2007). There are more references available in the full text ...
184–197. D. Du and R. Chandrasekaran; The maximum residual flow problem: NP-hardness with two-arc destruction; Networks 50 (2007); pp. 181–182. Ford; L. R. and ...