摘要
讨论在给定限制期情况下，边的长度（权值）为区间数的赋权图最小风险路径的选取算法，该算法将非线形比例路径问题的求解转化为最短路问题的变权迭代，算例及实际应用取得了令人满意的效果．
When arc lengths of a graph are interval numbers, it is a non linear problem to select an optimum path or a minimum risk path by a given deadline. However, this paper gives an algorithm to solve the problem by converting it to a series of shortest path problems. An example is presented, and the result is satisfactory.
出处
《系统工程学报》
CSCD
1999年第3期221-226,共6页
Journal of Systems Engineering
