摘要
建立了赋权有向图中两顶点间过指定顶点的最短路问题的线性规划模型。
In this paper, a linear programming model about the shortest path problem, in which the path has to pass appointed vertexes between two nodes in the weighted and directed graph, is established. And a solution to it is found by means of the primal dual algorithm.
出处
《西北纺织工学院学报》
1996年第3期280-284,共5页
Journal of Northwest Institute of Textile Science and Technology
关键词
原始-对偶算法
限定原始问题
最短路
线性规划
primal dual algorithm, the set of admissible columns, restricted primal, the shortest path
