摘要
利用网络的特性,采用遍历搜索方法对最短路径问题做出一个敏感性分析,适合于解决在一些实际系统模型中利用网络图进行规划时,需要对一些环节进行调整,却又能不破坏原最优计划的问题.
Using the network characteristics,the sensitivity analysis on the shortest path problems is made by the traverse method searching all adjacency nodes.It can be used to solve problems in network.Some links must be changed, but the primary optimal plan can be kept when the programme is made according to network maps in practical system models.
出处
《山东理工大学学报（自然科学版）》
CAS
2004年第3期50-52,共3页
Journal of Shandong University of Technology:Natural Science Edition
