《运筹》教学课件图论与网络第六章（五）最小费用最大流问题.pptVIP

最好的算法 Orlin算法 J. B.Orlin. A faster strongly polynomial minimum cost flow algorithm. Proceedings of the 20-th ACM Symposium on the theory of computing: 377-387 P. Kleinschmid, H. Schannath. A strongly polynomial algorithm for the transportation problem. Mathematical Programming, 1995, 68: 1-13 * the Minimum Cost Flow Problem 6.5.1 问题描述(Introduction) 如果给每条边都赋予一个权，那么网络的每一条边有两个数值，容量和权重。如果视权重为费用，我们的目的是如何找到最小费用的最大流。 6.5.2 模型(Model) 6.5.3 算法(Algorithm) 6.5.3 算法(Algorithm) vs vt v2 v3 v1 (4, 10) (1, 7) (2, 4) (6, 2) (2, 5) (3, 10) (1, 8) vs vt v2 v3 v1 0 0 0 0 0 0 0 4 1 2 6 2 3 1 vs vt v2 v3 v1 vs vt v2 v3 v1 0 0 0 0 0 0 0 5 5 5 6.5.3 算法(Algorithm) 6.5.3 算法(Algorithm) vs vt v2 v3 v1 (4, 10) (1, 7) (2, 4) (6, 2) (2, 5) (3, 10) (1, 8) vs vt v2 v3 v1 0 5 0 0 5 0 5 vs vt v2 v3 v1 -2 4 -1 3 6 2 1 1 -1 vs vt v2 v3 v1 5 0 5 0 0 0 5 2 7 6.5.3 算法(Algorithm) vs vt v2 v3 v1 (4, 10) (1, 7) (2, 4) (6, 2) (2, 5) (3, 10) (1, 8) vs vt v2 v3 v1 2 7 0 0 5 0 5 vs vt v2 v3 v1 -2 4 -1 3 6 2 1 -1 -4 vs vt v2 v3 v1 0 2 7 0 5 0 5 8 3 3 6.5.3 算法(Algorithm) vs vt v2 v3 v1 (4, 10) (1, 7) (2, 4) (6, 2) (2, 5) (3, 10) (1, 8) vs vt v2 v3 v1 2 7 3 0 5 3 8 vs vt v2 v3 v1 -2 4 -1 3 6 2 -1 -4 -3 -2 vs vt v2 v3 v1 2 3 5 3 7 0 8 3 4 4 4 6.5.3 算法(Algorithm) vs vt v2 v3 v1 (4, 10) (1, 7) (2, 4) (6, 2) (2, 5) (3, 10) (1, 8) vs vt v2 v3 v1 3 7 4 0 4 4 8 vs vt v2 v3 v1 -2 4 -1 3 6 -1 -4 -3 -2 2 6.5.3 算法(Algorithm) * * *