@article {IOPORT.04018804,
    author       = {Dushin, B.I. and Babushkin, A.I.},
    title        = {On the determination of the optimal combination of two priority rules in the travelling salesman problem.},
    year         = {1985},
    journal      = {Kibernetika},
    volume       = {1985},
    number       = {4},
    issn         = {0023-1274},
    pages        = {122-124},
    publisher    = {Izdatel'stvo Naukova Dumka, Kiev},
    abstract     = {For the given two orderings $\Pi\sb 1$ and $\Pi\sb 2$ of vertices of a weighted graph the authors consider a rule for constructing a new ordering $\Pi$. They show that using this rule it is possible to construct shortest paths in time $O(n\sp 3)$. If $\Pi\sb 1(i)=\Pi\sb 2(n- i-1)$ and $\Pi\sb 1$ and $\Pi\sb 2$ are allowed to be changed dynamically during the construction of $\Pi$ then by using the rule Hamiltonian cycles of minimal length can be constructed.},
    reviewer     = {M.Frumkin},
    identifier   = {04018804},
}