In this paper we consider a kind of the inverse shortest paths problem in which we want to adjust the given weights of arcs as less as possible so that a set of given paths become shortest ones from their sources to sinks,under an additional requirement that the weights of all arcs initiated from the same node must be adjusted by the same amount.
考虑了一类变形的反最短路问题 ,即在一种点调整约束的条件下 ,如何对网络的权向量进行尽可能少的调整 ,使得给定的路变为最短线路。
A strongly polynominal algorithm for the inverse shortest paths problem (ISP) is provided which was considered by D.
该算法将反最短线路问题转化为一种多物资循环流问题 ,因此可以用Tardos方法来解这类问
Traditionally,Dijkstra method is generally used to solve the shortest circuit problem in circuit teaching.
传统教学中一般使用Dijkstra方法解决最短线路问题。
This paper presents a solution to the problem of the shortest linear recurrence of two sequences over an integral domain and describes the recurrence of the minimal polynomial.
本文解决了整环上两条序列的最短线性递归问题 ,并给出了递归极小多项式的方法。
Based on the definition of the confidence interval, using the methed of numerical calculation, the minimum length of confidence interval for the variance of the normal distribution are found.
99,在样本容量n从3到30的范围内,在正态总体均值未知的情形下,求得了方差σ2的最短置信区间,并对用通常方法求得的置信区间的长度与最短置信区间的长度进行了对比分析。
Briefly on the shortest path algorithm in the urban road network;
浅析城市道路网中的最短路径算法
The Realization of Shortest Path Algorithm in Traffic System;
最短路径搜索算法在交通系统上的应用
Study on the multi-modal shortest path in time-varying network;
时变网络下多式联运的最短路径问题研究