About the minimum mean cycle-canceling algorithm
Discrete Applied Mathematics, Volume 196, Issue C, 2015, Pages 115-134.
Network flow problemResidual networkFlow decompositionMinimum mean cycleComplexity analysisMore(1+)
This paper focuses on the resolution of the capacitated minimum cost flow problem on a network comprising¿ n nodes and¿ m arcs. We present a method that counts imperviousness to degeneracy among its strengths, namely the minimum mean cycle-canceling algorithm¿(MMCC). At each iteration, primal feasibility is maintained and the objective fu...More
Full Text (Upload PDF)
PPT (Upload PPT)