| 罚转向网络最短路径算法及其复杂性研究 |
| |
| 引用本文： | 潘开灵,吕绪华.罚转向网络最短路径算法及其复杂性研究[J].经济数学,1998(4). |
| |
| 作者姓名： | 潘开灵 吕绪华 |
| |
| 作者单位： | 武汉冶金科技大学!武汉，430081 |
| |
| 基金项目： | 国家自然科学基金!79470066，香港项目!700154 |
| |
| 摘 要： | 本文建立和研究了具有转向惩罚值的网络模型．论文首先引入了罚转向网络符号及规则，对所建立的罚转向网络模型的性质进行了讨论，在证明了路径与子路径关系的三个定理之后，提出了求解其最短路径的算法并证明了算法的复杂性结论，论文最后给出了一个用该算法求解项转向网络的最短路径实例．
|
| 关 键 词： | 最短路径 网络图 转向惩罚值 算法复杂性 |
RESEARCH FOR SHORTEST-PATH ALGORITHM AND COMPLEXITY IN A NETWORK WITH SWERVE PENALTY |
| |
| Kailing Pan,Lu Xuhua.RESEARCH FOR SHORTEST-PATH ALGORITHM AND COMPLEXITY IN A NETWORK WITH SWERVE PENALTY[J].Mathematics in Economics,1998(4). |
| |
| Authors: | Kailing Pan Lu Xuhua |
| |
| Abstract: | This paper developed a model for the Network with Swerve Penalty (NSP). After the symbols and rules of NSP defined,the properties of NSP are studied and three theorems about the relation of paths and their sub-paths are proved. A shortest-path algorithm based on NSP is proposed and its complexity is showed. An example applying above algorithm to find shortest-paths is presented. |
| |
| Keywords: | Shortest-path network swerve penalty algorithm complexity |
| 本文献已被 CNKI 等数据库收录！ |
