网络最大流与最小割集的矩阵算法

Matrix Arithmetic of Network Maximal Flux and Minimal Separate Set

本文给出了解决运输问题为中心的一类特殊的线性规划问题的新的、简便的算法。网络最大流与最小割集的矩阵算法,不仅能解决许多这类问题,而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。

This paper gives simple arithmetic of an especial linear programming questions in transport. Matrix arithmetic of network maximal flux and minimal separate set not only solves these problems, but also solves some other problems by the computer such as minimal fee, distribution and transport.