A strongly polynomial Contraction-Expansion algorithm for network flow problems
Computers & OR, Volume 84, Issue C, 2017, Pages 16-32.
Network flow problemResidual networkContracted networkMinimum mean cost cycleComplexity analysisMore(1+)
This paper addresses the solution of the capacitated minimum cost flow problem on a network containingn nodes and m arcs. Satisfying necessary and sufficient optimality conditions can be done on the residual network although it can be quite time consuming as testified by the minimum mean cycle-canceling algorithm (MMCC). We introduce a co...More
Full Text (Upload PDF)
PPT (Upload PPT)