| 制造网络的一个最小费用最大流算法 |
| |
| 引用本文： | 张远福,谭毓澄,余剑敏.制造网络的一个最小费用最大流算法[J].江西师范大学学报(自然科学版),2007,31(6):622-624. |
| |
| 作者姓名： | 张远福 谭毓澄 余剑敏 |
| |
| 作者单位： | 九江学院理学系,江西,九江,332000 |
| |
| 基金项目： | 江西省教育厅基金资助项目(JXJG-O6-17-16) |
| |
| 摘 要： | 制造网络流广泛应用于解决水源的调度及工厂的产品运输、分配、合成等问题.该文提出一个制造网络流的最小费用最大流算法.
|
| 关 键 词： | 制造网络流问题 最小费用最大流 层数 |
| 文章编号： | 1000-5862（2007）06-0622-03 |
| 收稿时间： | 2007-03-22 |
| 修稿时间： | 2007年3月22日 |
The Algorithm of Maximum Flow and Minimum Cost for Manufacturing Network |
| |
| ZHANG Yuan-fun,TAN Yu-cheng,YU Jian-min.The Algorithm of Maximum Flow and Minimum Cost for Manufacturing Network[J].Journal of Jiangxi Normal University (Natural Sciences Edition),2007,31(6):622-624. |
| |
| Authors: | ZHANG Yuan-fun TAN Yu-cheng YU Jian-min |
| |
| Abstract: | Manufacturing network flow problem is applied widely in the distribution of the source of water and the transit of products that have some process of synthesis of different materials to one products and/or the distilling of one material to many different products.In this paper,I present an algorithm of maximum manufacturing network flow and minimum cost. |
| |
| Keywords: | manufacturing network problem maximum flow and minimum cost layer |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
