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…

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

Contents

Definition

edit edit source

Given flow network G(V,E) with:

l(v,w), lower bound on flow from node v to node w,
u(v,w), upper bound on flow from node v to node w,
c(v,w), cost of a unit of flow on (v,w)

and the constraints:

l(v,w)≤f(v,w)≤u(v,w),
∑w∈Vf(u,w)=0 (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

∑(v,w)∈Ec(v,w)⋅f(v,w).

Multi-commodity circulation

edit edit source

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

fi(v,w) The flow of commodity i from v to w.
f(v,w)=∑ifi(v,w) The total flow.

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

li(v,w)≤fi(v,w)

The conservation constraint must be upheld individually for the commodities:

 ∑w∈Vfi(u,w)=0.

Solution

edit edit source

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.[1]

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

edit edit source

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

  • Minimum cost multi-commodity circulation problem - Using all constraints given above.
  • Minimum cost circulation problem - Use a single commodity
  • Multi-commodity circulation - Solve without optimising cost.
  • Simple circulation - Just use one commodity, and no cost.
  • Multi-commodity flow - If Ki(si,ti,di) denotes a demand of di for commodity i from si to ti, create an edge (ti,si) with li(ti,si)=u(ti,si)=di for all commodities i. Let li(u,v)=0 for all other edges.
  • Minimum cost multi-commodity flow problem - As above, but minimize the cost.
  • Minimum cost flow problem - As above, with 1 commodity.
  • Maximum flow problem - Set all costs to 0, and add an edge from the sink t to the source s with l(t,s)=0, u(t,s)=∞ and c(t,s)=−1.
  • Minimum cost maximum flow problem - First find the maximum flow amount m. Then solve with l(t,s)=u(t,s)=m and c(t,s)=0.
  • Single-source shortest path - Let l(u,v)=0 and c(u,v)=1 for all edges in the graph, and add an edge (t,s) with l(t,s)=u(t,s)=1 and c(t,s)=0.
  • All-pairs shortest path - Let all capacities be unlimited, and find a flow of 1 for v(v−1)/2 commodities, one for each pair of nodes.

References

edit edit source
  1. ^ Éva Tardos (1985). "A strongly polynomial minimum cost circulation algorithm". Combinatorica. 5 (3): 247–255. doi:10.1007/BF02579369.
  2. ^ S. Even and A. Itai and A. Shamir (1976). "On the complexity of timetable and multi-commodity flow problems". SIAM Journal on Computing. 5 (4). SIAM: 691–703. doi:10.1137/0205048.{{cite journal}}: CS1 maint: deprecated archival service (link)

Text derived from https://en.wikipedia.org/w/index.php?oldid=1332013179 under CC BY-SA 4.0; modifications have been made.