摘要
本文讨论的是无负回路的有向网络,在已知网络各节点间最短路的前提下,当网络中的个别节点、权值、弧发生变化时,变化对最短路有无影响,若有,如何利用变化前的最短路得到改变后的最短路,即:利用网络的独特优势,建立最短路问题的灵敏度分析算法。
In this paper directed network of nonnegative loop is discussed. And also, on the occasion of network nodes shortest path being as known, whether variation of individual node, weight and arc can have influence on shortest path or not is studied. If the influence is produced, how to get changed shortest path using that of unchanged is represented, that is, establishing an arithmetic of the sensitivity analysis of shortest path problem by use of the network characteristics.
出处
《燕山大学学报》
CAS
2009年第1期60-62,共3页
Journal of Yanshan University
关键词
网络
灵敏度分析
最短路问题
network
sensitivity analysis
shortest pathproblem
