id: 04018804
dt: j
an: 04018804
au: Dushin, B.I.; Babushkin, A.I.
ti: On the determination of the optimal combination of two priority rules in
    the travelling salesman problem.
so: Kibernetika 1985, No.4, 122-124 (1985).
py: 1985
pu: Izdatel’stvo Naukova Dumka, Kiev
la: RU
cc: 
ut: priority rules; travelling salesman; weighted graph; shortest paths
ci: 
li: 
ab: For the given two orderings $Π\sb 1$ and $Π\sb 2$ of vertices of a
    weighted graph the authors consider a rule for constructing a new
    ordering $Π$. They show that using this rule it is possible to
    construct shortest paths in time $O(n\sp 3)$. If $Π\sb 1(i)=Π\sb 2(n-
    i-1)$ and $Π\sb 1$ and $Π\sb 2$ are allowed to be changed dynamically
    during the construction of $Π$ then by using the rule Hamiltonian
    cycles of minimal length can be constructed.
rv: M.Frumkin