In this paper，the piecewise-linear convex cost network flow is discussed. The methods of the negative circuit and the shortest cost path for the linear cost network flow problems are extended，thus obtaining two simple algorithms to solve the minimum cost network flow problem with piecewise-linear convex cost.