Maximum Multicommodity Flow with Intermediate Storage

Algorithm 3

Maximum dynamic multicommodity contraflow algorithm with intermediate storage.

	Input: given two-way dynamic multicommodity network .
	Output: maximum dynamic multicommodity contraflow with intermediate storage.
(1)	Construct an auxiliary network of .
(2)	Compute the maximum dynamic multicommodity flow with intermediate storage in by using Algorithm 2.
(3)	Decompose the flow along paths and cycles, and remove the flows in cycles .
(4)	An arc is reversed if and only if the flow along arc is greater than its capacity, or if there is a nonnegative flow along arc .