受容量限制的多品种物质运输问题的最小费用最大流算法

摘要

对于有容量限制的多品种物资运输问题,不仅可以用传统的表上作业法求解,还可以转化为最小费用最大流算法求解。事实证明,有容量限制的运输问题用最小费用最大流算法求解比表上作业法求解更方便。%The problem of multi-species material and transport issues with capacity constraints ,not only can be solved with the traditional calculating method on-table, but also can be calculated after being transformed into the minimum cost maximum flow method. In fact, it is really convenient to use the minimum cost maximum flow method than the traditional calculating method on-table.