A Minimum Generalized Distribution Cost Flow Problem

摘要：

In this paper, we consider a minimum generalized distribution cost flow problem. We discuss the properties of the basic feasible graph of the problem. By using the optimality conditions and the network simplex method, we solve the minimuM generalized distribution cost flow problem. We also get an algorithm to give a initial feasible basic of the problem.

关键词： Network flow Mathematical modeling Basic feasible solution

作者: Binwu Zhang Enyu Yao Liqun Qi Yanchen Li

作者单位: Department of Mathematics and Physics, Hohai University, Changzhou 213022,China Department of Mathematics, Zhejiang University, Hangzhou 310027, China Department of Mathematics, The Hong Kong Polytechnic University, Hong Kong, China college of computer and Information Engineering Hohai University Changzhou 213022

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 1071-1077

在线出版日期: 2009-06-01（万方平台首次上网日期，不代表论文的发表时间）