Uncapacitated Minimum Cost Flow Problem
Received:April 02, 2002  
Key Word: minimum cost   network flow   fixed cost.  
Fund ProjectL:
Author NameAffiliation
DONG Zhen-ning Economic and Management School
Guangdong Technology University
Guangzhou
China 
LIU Jia-zhuang School of Mathematic and Systems Science
Shandong University
Jinan
China 
Hits: 1610
Download times: 2993
Abstract:
      We study uncapacitated version of the minimum cost flow problem of one-commodity and two-commodity with not only fixed cost but also variable cost, and give them each a polynomial algorithm. Moreover, we solve an example of uncapacitated two-commodity minimum cost flow problem with the algorithm.
Citation:
DOI:10.3770/j.issn:1000-341X.2004.04.026
View Full Text  View/Add Comment  Download reader