| 网络最大流与最小割集的矩阵算法 |
| |
| 引用本文： | 毕雅军,刘戈.网络最大流与最小割集的矩阵算法[J].北华航天工业学院学报,2006,16(6):17-19. |
| |
| 作者姓名： | 毕雅军 刘戈 |
| |
| 作者单位： | 1. 北华航天工业学院,基础部,河北,廊坊,065000
2. 北华航天工业学院,经济管理系,河北,廊坊,065000 |
| |
| 摘 要： | 本文给出了解决运输问题为中心的一类特殊的线性规划问题的新的、简便的算法.网络最大流与最小割集的矩阵算法,不仅能解决许多这类问题,而且能使最小费用流、分配问题和运输问题容易通过计算机来实现.
|
| 关 键 词： | 网络最大流 最小割集 增广链 |
| 文章编号： | 1673-7938（2006）06-0017-03 |
| 收稿时间： | 2006-09-26 |
| 修稿时间： | 2006-09-26 |
Matrix Arithmetic of Network Maximal Flux and Minimal Separate Set |
| |
| BI Ya-jun,LIU Ge.Matrix Arithmetic of Network Maximal Flux and Minimal Separate Set[J].Journal of North China Institute of Aerospace Engineering,2006,16(6):17-19. |
| |
| Authors: | BI Ya-jun LIU Ge |
| |
| Institution: | 1. Fundamental Science Department, North China Institute of Aerospace Engineering, Langfang 065000, China; 2. Management Engineering Department, North China Institute of Aerospace Engineering, Langfang 065000, China |
| |
| Abstract: | 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. |
| |
| Keywords: | network maximal flux minimal separate set broader chain |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
