网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。
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.
并结合太钢目前现有的检修条件及运输特点，采用SWOT矩阵的分析方法对太钢自有铁道车辆的检修方式进行了优化选择。
Combining the repair condition and transport characteristic at TISCO, the repair mode was optimized by taking SWOT matrix to railway wagon at TISCO.
并结合太钢目前现有的检修条件及运输特点，采用SWOT矩阵的分析方法对太钢自有铁道车辆的检修方式进行了优化选择。
Combining the repair condition and transport characteristic at TISCO, the repair mode was optimized by taking SWOT matrix to railway wagon at TISCO.
应用推荐