Lexicographically Maximum Contraflow Problem with Vertex Capacities

Algorithm 1

LexMSCF algorithm.

(1)	Given a static network , with , for all and integer inputs.
(2)	Transform into network as in [2] and set .
(3)	Solve LexMSF problem on network using algorithm in [14].
(4)	Perform flow decomposition into path and cycle flows of maximum flows obtained from step 3 and remove all cycle flows.
(5)	Arc is reversed if and only if the flow along arc is greater than or if there is non-negative flow along arc .
(6)	Obtain LexMSCF solution on .