Integrality in the multinetwork min‐cost equal‐flow problem

Abstract

We consider the min-cost flow problem on multiple networks defined on duplicates of the same directed graph. The problem is to compute feasible flows such that the sum of flow costs is minimized subject to network demands and coupling constraints that force identical flows on duplicate copies of the same edge for a subset of "special" edges. We focus on whether such a problem has an integer optimal solution. For the case of integer capacities and demands and flow equality on a single edge, there is always an integer optimal solution and it can be found efficiently. For flow equality on multiple edges, we characterize the cases, with respect to the number of special edges and the number of networks, where if the graph is series-parallel then an integer optimal solution exists for all possible capacity and cost functions.

Robust transshipment problem under consistent flow constraints

“…The statement holds true even if a nontrivial solution is guaranteed to exist. Hassin and Poznanski [13] analyze the integrality of the multinetwork min‐cost equal‐flow problem ( mEFP ) problem and prove the ‐hardness for acyclic digraphs.…”

Algorithms and complexity for the almost equal maximum flow problem

“…Recently, an extension to networks defined as duplicates of graphs with equal flow on duplicate arcs was studied by Hassin and Poznaski (cf. [8]). A complexity study of a robust variant of the minimum cost equal flow problem was carried out by [4].…”