Integrality in the multinetwork min-cost equal-flow problem

Refael Hassin, Renata Poznanski

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)267-273
Number of pages7
JournalNetworks
Volume80
Issue number3
DOIs
StatePublished - Oct 2022

Keywords

  • computational complexity
  • equal-flow problem
  • integral solutions
  • min-cost flow

Fingerprint

Dive into the research topics of 'Integrality in the multinetwork min-cost equal-flow problem'. Together they form a unique fingerprint.

Cite this