节点文献
制造网络的一个最小费用最大流算法
The Algorithm of Maximum Flow and Minimum Cost for Manufacturing Network
【摘要】 制造网络流广泛应用于解决水源的调度及工厂的产品运输、分配、合成等问题.该文提出一个制造网络流的最小费用最大流算法.
【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.
【关键词】 制造网络流问题;
最小费用最大流;
层数;
【Key words】 manufacturing network problem; maximum flow and minimum cost; layer;
【Key words】 manufacturing network problem; maximum flow and minimum cost; layer;
【基金】 江西省教育厅基金资助项目(JXJG-O6-17-16)
- 【文献出处】 江西师范大学学报(自然科学版) ,Journal of Jiangxi Normal University(Natural Sciences Edition) , 编辑部邮箱 ,2007年06期
- 【分类号】O224
- 【被引频次】4
- 【下载频次】426