| 网络最短的最优解集结构 |
| |
| 引用本文： | 张振坤,王斌.网络最短的最优解集结构[J].数学季刊,2007,22(4):530-537. |
| |
| 作者姓名： | 张振坤 王斌 |
| |
| 作者单位： | 1.Department of Scientific Research Affairs，Hnanghuai University，Zhumadian 463000，China;2.Basic Science Institute，Zhongzhou University，Zhengzhou 450052，China |
| |
| 摘 要： | The shortest path problem in a network G is to find shortest paths between some specified source vertices and terminal vertices when the lengths of edges are given. The structure of the optimal solutions set on the shortest paths is studied in this paper. First,the conditions of having unique shortest path between two distinguished vertices s and t in a network G are discussed;Second,the structural properties of 2-transformation graph (?) on the shortest-paths for G are presented heavily.
|
| 关 键 词： | 网络 转化图 结构特点 最佳解 |
| 文章编号： | 1002-0462（2007）04-0530-08 |
| 收稿时间： | 2004-11-10 |
| 修稿时间： | 2004年11月10 |
The Structure of the Optimal Solution Set on the Shortest Paths for Networks |
| |
| ZHANG Zhen-kun,WANG Bin.The Structure of the Optimal Solution Set on the Shortest Paths for Networks[J].Chinese Quarterly Journal of Mathematics,2007,22(4):530-537. |
| |
| Authors: | ZHANG Zhen-kun WANG Bin |
| |
| Abstract: | The shortest path problem in a network G is to find shortest paths between some specified source vertices and terminal vertices when the lengths of edges are given. The structure of the optimal solutions set on the shortest paths is studied in this paper. First,the conditions of having unique shortest path between two distinguished vertices s and t in a network G are discussed;Second,the structural properties of 2-transformation graph (?) on the shortest-paths for G are presented heavily. |
| |
| Keywords: | networks the shortest-paths 2-transformation graphs structural properties |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
