| 用原始－对偶算法求解过指定顶点的最短路 |
| |
| 引用本文： | 李湘露. 用原始－对偶算法求解过指定顶点的最短路[J]. 西安工程科技学院学报, 1996, 0(3) |
| |
| 作者姓名： | 李湘露 |
| |
| 作者单位： | 郑州纺织工学院工商管理系 |
| |
| 摘 要： | 建立了赋权有向图中两顶点间过指定顶点的最短路问题的线性规划模型，用原始－对偶算法给出一个求解方法
|
| 关 键 词： | 原始－对偶算法 容许弧集 限定原始问题 最短路 |
The mal Dual Algorithm Applied to Shortest Path Problem of Passing Appointed Vertexes |
| |
| Li Xianglu. The mal Dual Algorithm Applied to Shortest Path Problem of Passing Appointed Vertexes[J]. Journal of Xi an University of Engineering Science and Technology, 1996, 0(3) |
| |
| Authors: | Li Xianglu |
| |
| Abstract: | 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. |
| |
| Keywords: | primal dual algorithm the set of admissible columns restricted primal the shortest path |
| 本文献已被 CNKI 等数据库收录！ |
