  The minimum cost-flow problems have been attracted recently in optimization
because of their applications in several areas of applied science and real
life. Therefore, finding optima solution of these problems would be
significant. Although some heuristic approaches have been proposed for solving
the problem, but there is no any method to summarize information and converting
from a graph form to a table. In this paper, at first all information of the
problem are summarized in a table and then an efficient algorithm based on
considering costs and flows is proposed. The algorithm is strongly efficient
for problems with large size and it has sufficiently suitable results by
solving some our generated problems.
