| Article ID: | iaor20062322 |
| Country: | China |
| Volume: | 14 |
| Issue: | 1 |
| Start Page Number: | 19 |
| End Page Number: | 22 |
| Publication Date: | Feb 2005 |
| Journal: | Operations Research and Management Science |
| Authors: | Yuan Xun, Yan Congquan, Liu Hui |
| Keywords: | programming: network, networks: flow |
This paper concerns two methods of acquiring primitive solution on network for transportation problem, and the primitive solution is almost optimal solution for solving the transportation problem with time constrained. An example is given to demonstrate the use of the algorithm.