摘要
提出一种强多项式算法 .该算法将反最短线路问题转化为一种多物资循环流问题 。
A strongly polynominal algorithm for the inverse shortest paths problem (ISP) is provided which was considered by D.Burton and Ph.L.Tonit. The ISP problem as a multi commodity circulation flow problem is transformed, then the multi commodity circulation flow problem by Tardos′ method is solved.
出处
《华中理工大学学报》
CSCD
北大核心
2000年第11期70-72,共3页
Journal of Huazhong University of Science and Technology
关键词
反最短线路
多种资源循环流
强多项式算法
inverse shortest path
multi commodity circulation flow, and strongly polynominal algorithL
