Secondly, the max-plus algebra and the max-plus algebra are used to solve the shortest path that is the admissible solution.
其次， 运用极大代数求出起点至终点的最短路，即获得模型的一个可行解；
In respect to the shortest path problem of the weighed direct graph, the iterative method of minimum algebra is established.
最短初等链法是求解网络图最短路问题的通用算法，它突破了以往诸算法的局限性，适用范围广，具有广阔应用前景。
On the principle of path-algebra and introducing in lengthening matrix, passing array, open-closed flag and non-circuit minimal path matrix, etc.
应用路径代数原理，通过引入途经数组等，给出一种TSP的新解法。
On the principle of path-algebra and introducing in lengthening matrix, passing array, open-closed flag and non-circuit minimal path matrix, etc.
应用路径代数原理，通过引入途经数组等，给出一种TSP的新解法。
应用推荐