摘要
DIMCRA算法能很好地解决多个加性约束下的链路分离路径问题的算法。论文对DIMCRA算法进行了理论分析,并证明了存在一类链路分离路径问题是该算法不能解决的。随后在算法中引入了组合差分的概念,对算法进行了优化,并通过实例仿真说明了改进后的算法能弥补原算法的不足。
Algorithm DIMCRA can solve link disjoint paths problem with multiple additive constraints well.This article has analyzed algorithm DIMCRA,and has proved that the there is a sort of the link-disjoint problem the algorithm DIMCRA cannot solved.Then author has introduced the combination difference which has optimized the old algorithm,and has given an instance to show that the improved algorithm can improve the algorithm＇s performance.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第2期169-171,共3页
Computer Engineering and Applications
