↑ arvau

Wikipedia / Circulation problem

The circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation also being required for the source and sink (i.e. there are no special nodes). In variants of the problem, there are multiple commodities flowing through the network, and a cost on the flow.

Definition

with:

  1. ,

  2. ,

and the constraints:

  1. ,

  2. (flow cannot appear or disappear in nodes).

Finding a flow assignment satisfying the constraints gives a solution to the given circulation problem.

In the minimum cost variant of the problem, minimize

Multi-commodity circulation

In a multi-commodity circulation problem, you also need to keep track of the flow of the individual commodities:

  1. {|

|| The total flow. |}

There is also a lower bound on each flow of commodity.

  1. {|

|}

The conservation constraint must be upheld individually for the commodities:

Solution

For the circulation problem, many polynomial algorithms have been developed (e.g., Edmonds–Karp algorithm, 1972; Tarjan 1987-1988). Tardos found the first strongly polynomial algorithm.

For the case of multiple commodities, the problem is NP-complete for integer flows. For fractional flows, it is solvable in polynomial time, as one can formulate the problem as a linear program.

Related problems

Below are given some problems, and how to solve them with the general circulation setup given above.

References