对运量有上界的转运问题进行研究，给出了求解此类问题的两种求解算法：表上作业法和最小费用最大流法。
Two methods of the minimum expenses and maximum flux and the table dispatching method to the rotating-transporting problem with a transport amounts upper bound were given.
讨论了一种地理信息系统空间分析算法——最短路径分析，然后利用最短路径结果，采用表上作业法将灾害救援物资进行优化，给出最优调运方案。
Then it optimized the rescue supplies using form operation method based on the result of the shortest path, and selected the optimal transportation scheme.
本文提出广探生长树法是表上作业法中搜索闭回路的一种快速算法。
We put forward a broad-searching-growing-tree-method that is a quicker algorithm for searching closed loop in operation-at-table-method.
本文针对受时间约束的运输问题，提出了一种基于表上作业法的优化求解算法，并用算例说明了该算法的求解过程。
Aiming at the transportation problem with time constrained, a kind of optimized arithmetic based on table-working method is presented in this paper.
本文针对受时间约束的运输问题，提出了一种基于表上作业法的优化求解算法，并用算例说明了该算法的求解过程。
Aiming at the transportation problem with time constrained, a kind of optimized arithmetic based on table-working method is presented in this paper.
应用推荐