View source for Successive shortest paths with reduced costs

== Abstract view ==

'''Auxiliary data:'''
For each node <math>v\in V</math>, there is a real number <math>\pi(v)</math>.

'''Invariant:'''
# All points of the invariant of the [[Successive shortest paths|successive shortest paths]] algorithm.
# For each arc <math>a=(v,w)\in A_f</math>, the '''reduced cost''' <math>c^\pi(a):=c(a)-\pi(v)+\pi(w)</math> is nonnegative.

'''Definition:'''
Such a node labeling <math>\pi</math> is called '''consistent''' with <math>f</math> in the following.

== Induction basis ==

'''Abstract view:'''
Start with the zero flow <math>f</math> and with the zero node labeling <math>\pi</math>.

'''Proof:'''
The assumption that all cost values are nonnegative implies that <math>\pi\equiv 0</math> is consistent with <math>f\equiv 0</math>.

== Induction step ==

'''Abstract view:'''
The induction step is a variation and extension of the [[Successive shortest paths#Induction step|induction step]] of the [[Successive shortest paths|successive shortest paths algorithm]]. The essential modification is that <math>c</math> is replaced by <math>c^\pi</math>. Due to point 2 of the invariant, it is always <math>c^\pi\geq 0</math>. Therefore, an efficient algorithm such as [[Dijkstra|Dijkstra's]] may be applied. The extension is that, after each augmentation of the flow, the reduced cost values must be updated to maintain consistency.

'''Implementation''' of the update of the reduced cost values:
# Run a [[Single source shortest paths|single-source shortest-paths algorithm]] with start node <math>s</math> and withe the current reduced cost values <math>c^\pi</math> as arc length.
# For all nodes <math>v\in V</math>, set <math>\pi(v):=\pi(v)-\delta(v)</math>, where <math>\delta(v)</math> is the distance of <math>v</math> computed in step 1.

'''Remark:'''
The start node <math>s</math> could be an original node of <math>V</math>. However, if some nodes are not reachable from <math>s</math> in the [[Basic flow definitions#Residual network|residual network]], arcs with large capacity and zero cost have to be inserted in <math>A</math> until all nodes are reachable from <math>s</math>.

'''Proof:'''
The variant and points 1 and 3 of the invariant of the [[Successive shortest paths|successive shortest paths algorithm]] are obviously maintained. For point 2 of that invariant, it suffices to show that the shortest paths with respect to the arc lengths <math>c^\pi</math> are also shortest paths with respect to the arc lengths <math>c</math>; however, that results immediately from [[Basics of shortest paths#(Admissible) node potentials|this statement]].

It remains to show that the updated node potentials are consistent with the augmented flow. Let <math>\pi_\mathrm{before}</math> and <math>\pi_\mathrm{after}</math> denote the values of <math>\pi</math> immediately before and after the current iteration, respectively. Let <math>(v,w)</math> be an arc in the [[Basic flow definitions#Residual network|residual network]] of the augmented flow, that is, the flow immediately after the current iteration. We make a case distinction:
# If <math>(v,w)</math> was also in the residual network immediately before the current iteration, the new reduced cost of <math>(v,w)</math> is <math>c^{\pi_\mathrm{after}}(v,w)=c(v,w)-\pi_\mathrm{after}(v)+\pi_\mathrm{after}(w)=c(v,w)-\left[\pi_\mathrm{before}(v)-\delta(v)\right]+\left[\pi_\mathrm{before}(w)-\delta(w)\right]=c^{\pi_\mathrm{before}}(v,w)-\delta(w)+\delta(v)</math>. As the <math>\delta</math>-values are shortest-path distances with respect to arc lengths <math>c^{\pi_\mathrm{before}}</math>, the [[basics of shortest paths#Valid distance property|valid distance property]] yields <math>\delta(w)\leq\delta(v)+c^{\pi_\mathrm{before}}(v,w)</math>, which proves the claim.
# Otherwise, <math>(w,v)</math> is on the shortest path computed in the current iteration. Recall <math>c(v,w)=-c(w,v)</math>, so we obtain

<math>c^{\pi_\mathrm{after}}(v,w)=</math>

<math>c(v,w)-\pi_\mathrm{after}(v)+\pi_\mathrm{after}(w)=</math>

<math>-\left[c(w,v)-\pi_\mathrm{after}(w)+\pi_\mathrm{after}(v)\right]=</math>

<math>-\left[c(w,v)-(\pi_\mathrm{before}(w)-\delta(w))+(\pi_\mathrm{before}(v)-\delta(v))\right]=</math>

<math>-\left[c^{\pi_\mathrm{before}}(w,v)-\delta(v)+\delta(w)\right]</math>.

[[Basics of shortest paths#Distances along shortest paths|This statement]] proves that the last expression is zero.

== Complexity ==

The asymptotic complexity and its proof are identical to the [[Successive shortest paths#Complexity|complexity considerations]] of the [[Successive shortest paths|successive shortest paths algorithm]].