Robust minimum cost flow problem under consistent flow constraints
Annals of Operations Research, vol. 312, pp. 691–722
Abstract
Abstract The robust minimum cost flow problem under consistent flow constraints (RobMCF $$\equiv $$ ≡ ) is a new extension of the minimum cost flow (MCF) problem. In the RobMCF $$\equiv $$ ≡ problem, we consider demand and supply that are subject to uncertainty. For all demand realizations, however, we require that the flow value on an arc needs to be equal if it is included in the predetermined arc set given. The objective is to find feasible flows that satisfy the equal flow requirements while minimizing the maximum occurring cost among all demand realizations. In the case of a finite discrete set of scenarios, we derive structural results which point out the differences with the polynomial time solvable MCF problem in networks with integral demands, supplies, and capacities. In particular, the Integral Flow Theorem of Dantzig and Fulkerson does not hold. For this reason, we require integral flows in the entire paper. We show that the RobMCF $$\equiv $$ ≡ problem is strongly $$\mathcal {NP}$$ NP -hard on acyclic digraphs by a reduction from the (3, B2)-Sat problem. Further, we demonstrate that the RobMCF $$\equiv $$ ≡ problem is weakly $$\mathcal {NP}$$ NP -hard on series-parallel digraphs by providing a reduction from Partition. If in addition the number of scenarios is constant, we propose a pseudo-polynomial algorithm based on dynamic programming. Finally, we present a special case on series-parallel digraphs for which we can solve the RobMCF $$\equiv $$ ≡ problem in polynomial time.
Authors 3
-
Affiliation as printed
Lehrstuhl ii für Mathematik, RWTH Aachen University, Pontdriesch 10-12, 52062, Aachen, Germany
-
Affiliation as printed
Lehrstuhl ii für Mathematik, RWTH Aachen University, Pontdriesch 10-12, 52062, Aachen, Germany
-
Affiliation as printed
Lehrstuhl ii für Mathematik, RWTH Aachen University, Pontdriesch 10-12, 52062, Aachen, Germany
Cited by 10 stored of 10
10 results
No patents citing this paper on Lens.org (checked 2026-10-06).
References 37
-
W2165775468details pending0citations
-
W2114616381details pending0citations
-
W2092506216details pending0citations
-
W151938810details pending0citations
-
W200056458details pending0citations
-
W1510098824details pending0citations
-
W1851375266details pending0citations
-
W1966645155details pending0citations
-
W1968248813details pending0citations
-
W1974898002details pending0citations
-
W1982901325details pending0citations
-
W1985495277details pending0citations
-
W1995246641details pending0citations
-
W1996680903details pending0citations
-
W2000200530details pending0citations
-
W2006146932details pending0citations
-
W2009550509details pending0citations
-
W2016885155details pending0citations