Strong Polynomial Time Solvability of Minimum Concave Cost Network Flow Problem

Hoang Tuy

Abstract

        A new simple proof is given of the strong polynomial-time solvability of the single source uncapacitated minimum concave cost network flow problem (SSUMCCNFP) with a fixed number of nonlinear arc costs.