摘要
众所周知,1958年我国工作者提出的关于运输问题的图上作业法并不是一个完善的算法。虽然它被纳入了单形法的框架,但仍然不是一个好算法。本文利用最短路算法修订了图上作业法,得到了两个拟多项式算法。
The graphical method of transportation problem is a well know, but not mature, algorithm arisen in 1958. Although being revised into a form of network simplex method, it is still not a good algorithm. In this paper, we revise the graphical method by means of the Shortest path algorithm, and obtain two variants which are pseudo-polynomial algorithms.
出处
《郑州大学学报（理学版）》
CAS
1989年第1期29-34,共6页
Journal of Zhengzhou University:Natural Science Edition
关键词
图上作业法
最短路
拟多项式算法
Graphical method, ShorteSt path, Pseudo-polynomial algorithm.
