| Article ID: | iaor20063618 |
| Country: | China |
| Volume: | 22 |
| Issue: | 5 |
| Start Page Number: | 774 |
| End Page Number: | 780 |
| Publication Date: | Oct 2005 |
| Journal: | Chinese Journal of Engineering Mathematics |
| Authors: | Zhang Yuanfu, Ye Zhengdao, Tang Jingbo |
The manufacturing network flow problem is applied widely in the distribution of water source and the transit of products that have some process of synthesis of different materials to one product and/or the distribution of one material to many different products. In this paper, we present a maximal flow algorithm for manufacturing network flow.