New Algorithm for the Transportation Problem
Jianhua Zhang · Yunchou yu guanli · 2007
In this paper we successfully solve the transportation problem using the label method for the assignment problem and prove that its treatment of nonnegative can be omitted,thus extend Dijkstra algorithm to the transportation problem with possible negative weight of edge.Compared with other usual methods,the method is visualized,simple,costs less computational time and is easier to be generalized.Lastly,the algorithm is proved to be polynomial and complexity of computation is only.