中文摘要：

基于对偶原理提出了求解最小费用流的一种新算法,该算法不需要传统方法中的构造剩余网络以及求最短路等步骤,而是保持互补松弛条件不变,通过在原网络中修改节点的势,给节点标号寻求目标流。并给出了新算法正确性的证明。算例表明该算法可明显减少迭代步骤。

英文摘要：

A new algorithm is proposed to solve the problem of minimum cost flow by a dual approach,which held complementarity conditions to the dual problem and found a desired flow by modifying the potential and labeling for each node of the network.Unlike existing algorithms,the new algorithm did not construct a residual network nor find the shortest path.The validity of the new algorithm is proved,and an example is given to illustrate the behavior of the proposed algorithm.