求解最小费用最大流问题的外枝界定法

A Branch-bounded Method of Settling the Problem of Min-cost and Max-flow

本文纠正文中的一个当之处，对于在保证最大流的前提下，求解最小费用最大流问题，给出一种便于在计算机上操作的分枝界定算法。

One unsuitable conclusion of paper~[1] was corrected in this paper. A branchbounded method of operating easier on computer was given about settling the problem of Mincost and Max-flow under the Max-flow was pledged.